Image encoding/decoding method and apparatus, and recording medium storing bitstream

ABSTRACT

An image decoding method is disclosed in the present specification. A method of decoding an image, the method may comprises determining whether to perform a context update for a first syntax element of a current block, updating, on the basis of the determination, a context for entropy decoding of the first syntax element and generating, on the basis of the updated context, a bin for the first syntax element, and wherein whether to perform the context update is determined on the basis of the number of pre-decoded predetermined syntax elements for the current block.

TECHNICAL FIELD

The present invention relates to a method and an apparatus for encoding/decoding an image, and a recording medium for storing a bitstream. More particularly, the present invention relates to a method and an apparatus for encoding/decoding an image on the basis of an entropy coding, and a recording medium for storing a bitstream.

BACKGROUND ART

Recently, demands for high-resolution and high-quality images such as high definition (HD) images and ultra high definition (UHD) images, have increased in various application fields. However, higher resolution and quality image data has increasing amounts of data in comparison with conventional image data. Therefore, when transmitting image data by using a medium such as conventional wired and wireless broadband networks, or when storing image data by using a conventional storage medium, costs of transmitting and storing increase. In order to solve these problems occurring with an increase in resolution and quality of image data, high-efficiency image encoding/decoding techniques are required for higher-resolution and higher-quality images.

Image compression technology includes various techniques, including: an inter-prediction technique of predicting a pixel value included in a current picture from a previous or subsequent picture of the current picture; an intra-prediction technique of predicting a pixel value included in a current picture by using pixel information in the current picture; a transform and quantization technique for compressing energy of a residual signal; an entropy encoding technique of assigning a short code to a value with a high appearance frequency and assigning a long code to a value with a low appearance frequency, etc. Image data may be effectively compressed by using such image compression technology, and may be transmitted or stored.

DISCLOSURE Technical Problem

An objective of the present invention is to provide an image encoding/decoding method and apparatus capable of improving compression efficiency, and a recording medium in which a bitstream generated by the method or apparatus is stored.

Another objective of the present invention is to provide an image encoding/decoding method and apparatus capable of improving compression efficiency by using an entropy coding and a recording medium in which a bitstream generated by the method or apparatus is stored.

Another objective of the present invention is to provide an image encoding/decoding method and apparatus capable of improving throughput by using an entropy coding and a recording medium in which a bitstream generated by the method or apparatus is stored.

Technical Solution

According to the present invention, image decoding method comprises determining whether to perform a context update for a first syntax element of a current block, updating, on the basis of the determination, a context for entropy decoding of the first syntax element and generating, on the basis of the updated context, a bin for the first syntax element, wherein whether to perform the context update is determined on the basis of the number of pre-decoded predetermined syntax elements for the current block.

Wherein when the number of the pre-decoded predetermined syntax elements is equal to or less than a preset value, the context update for the first syntax element is performed.

Wherein the preset value is determined on the basis of a size of the current block.

Wherein only when the current block is in a transform skip mode, the context update is performed.

Wherein the first syntax element is a syntax element related to a residual signal of the current block.

Wherein the first syntax element is the syntax element indicating a sign of a quantized level.

Wherein the first syntax element is coeff_sign_flag.

Wherein the predetermined syntax element is at least one of residual signal-related syntax elements.

Wherein the predetermined syntax elements are coeff_sign_flag, sig_coeff_flag, abs_level_gtx_flag, and par_level_flag.

According to the present invention, an image encoding method comprises generating a bin for a first syntax element of a current block by binarizing the first syntax element, determining whether to perform a context update for the first syntax element, updating, on the basis of the determination, a context for entropy encoding of the first syntax element and generating a bitstream for the current block by using the updated context and the generated bin, wherein whether to perform the context update is determined on the basis of the number of pre-encoded predetermined syntax elements for the current block.

Wherein when the number of the pre-encoded predetermined syntax elements is equal to or less than a preset value, the context update for the first syntax element is performed.

Wherein the preset value is determined on the basis of a size of the current block.

Wherein only when the current block is in a transform skip mode, the context update is performed.

Wherein the first syntax element is a syntax element related to a residual signal of the current block.

Wherein the first syntax element is the syntax element indicating a sign of a quantized level.

Wherein the first syntax element is coeff_sign_flag.

Wherein the predetermined syntax element is at least one of residual signal-related syntax elements.

Wherein the predetermined syntax elements are coeff_sign_flag, sig_coeff_flag, abs_level_gtx_flag, and par_level_flag.

According to a present invention, a computer-readable recording medium storing a bitstream that is received by an apparatus for decoding an image and is used to reconstruct a current block included in a current picture, wherein the bitstream is generated by a method of encoding an image, the method includes generating a bin for a first syntax element of the current block by binarizing the first syntax element, determining whether to perform a context update for the first syntax element, updating, on the basis of the determination, a context for entropy encoding of the first syntax element and generating a bitstream by using the updated context and the generated bin, wherein whether to perform the context update is determined on the basis of the number of pre-encoded predetermined syntax elements for the current block.

Advantageous Effects

According to the present invention, it is possible to provide an image encoding/decoding method and apparatus capable of improving compression efficiency and to provide a recording medium in which a bitstream generated by the method or apparatus is stored.

In addition, according to the present invention, it is possible to provide an image encoding/decoding method and apparatus capable of improving compression efficiency by using an entropy coding and a recording medium in which a bitstream generated by the method or apparatus is stored.

In addition, according to the present invention, it is possible to provide an image encoding/decoding method and apparatus capable of improving throughput by using an entropy coding and a recording medium in which a bitstream generated by the method or apparatus is stored.

DESCRIPTION OF DRAWINGS

FIG. 1 is a view of a block diagram showing a configuration of an encoding apparatus to which the present invention is applied.

FIG. 2 is a view of a block diagram showing a configuration of a decoding apparatus to which the present invention is applied.

FIG. 3 is a view schematically showing a partition structure when encoding and decoding an image.

FIG. 4 is a view showing an example of intra-prediction.

FIG. 5 is a view showing an example of inter-prediction.

FIG. 6 is a view showing an example of transform and quantization.

FIG. 7 is a view showing reference samples that are usable for intra-prediction.

FIG. 8 is a view showing an entropy decoding apparatus according to one embodiment of the present invention.

FIG. 9 is a view showing an entropy encoding apparatus according to one embodiment of the present invention.

FIG. 10 is a diagram illustrating an entropy encoding method and an entropy decoding method according to an embodiment of the present invention.

FIG. 11 is a diagram illustrating an entropy encoding method and an entropy decoding method according to another embodiment of the present invention.

FIG. 12 is another diagram illustrating an entropy encoding method according to an embodiment of the present invention.

FIG. 13 is another diagram illustrating an entropy decoding method according to an embodiment of the present invention.

FIG. 14 is a diagram illustrating a context and a binary string according to an embodiment of the present invention.

FIG. 15 is a diagram illustrating a context update method using a look-up table according to an embodiment of the present invention.

FIG. 16 is another diagram illustrating a context update method using a look-up table according to an embodiment of the present invention.

FIG. 17 is a diagram illustrating a context update method using a linear probability update model according to an embodiment of the present invention.

FIG. 18 is a diagram illustrating a context update method using a look-up table according to another embodiment of the present invention.

FIG. 19 is a diagram illustrating a context update method using a linear probability update model according to another embodiment of the present invention.

FIG. 20 is a diagram illustrating a context update method using a probability distribution model according to an embodiment of the present invention.

FIG. 21 is a diagram illustrating a method in which an entropy encoding or decoding process and a context update process are simultaneously performed according to an embodiment of the present invention.

FIG. 22 is a diagram illustrating context initialization according to an embodiment of the present invention.

FIG. 23 is a diagram illustrating context initialization according to another embodiment of the present invention.

FIG. 24 is a diagram illustrating a bitstream according to an embodiment of the present invention.

FIG. 25 is a diagram illustrating a bitstream according to another embodiment of the present invention.

BEST MODE

A variety of modifications may be made to the present invention and there are various embodiments of the present invention, examples of which will now be provided with reference to drawings and described in detail. However, the present invention is not limited thereto, although the exemplary embodiments can be construed as including all modifications, equivalents, or substitutes in a technical concept and a technical scope of the present invention. The similar reference numerals refer to the same or similar functions in various aspects. In the drawings, the shapes and dimensions of elements may be exaggerated for clarity. In the following detailed description of the present invention, references are made to the accompanying drawings that show, by way of illustration, specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to implement the present disclosure. It should be understood that various embodiments of the present disclosure, although different, are not necessarily mutually exclusive. For example, specific features, structures, and characteristics described herein, in connection with one embodiment, may be implemented within other embodiments without departing from the spirit and scope of the present disclosure. In addition, it should be understood that the location or arrangement of individual elements within each disclosed embodiment may be modified without departing from the spirit and scope of the present disclosure. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present disclosure is defined only by the appended claims, appropriately interpreted, along with the full range of equivalents to what the claims claim.

Terms used in the specification, ‘first’, ‘second’, etc. can be used to describe various components, but the components are not to be construed as being limited to the terms. The terms are only used to differentiate one component from other components. For example, the ‘first’ component may be named the ‘second’ component without departing from the scope of the present invention, and the ‘second’ component may also be similarly named the ‘first’ component. The term ‘and/or’ includes a combination of a plurality of items or any one of a plurality of terms.

It will be understood that when an element is simply referred to as being ‘connected to’ or ‘coupled to’ another element without being ‘directly connected to’ or ‘directly coupled to’ another element in the present description, it may be ‘directly connected to’ or ‘directly coupled to’ another element or be connected to or coupled to another element, having the other element intervening therebetween. In contrast, it should be understood that when an element is referred to as being “directly coupled” or “directly connected” to another element, there are no intervening elements present.

Furthermore, constitutional parts shown in the embodiments of the present invention are independently shown so as to represent characteristic functions different from each other. Thus, it does not mean that each constitutional part is constituted in a constitutional unit of separated hardware or software. In other words, each constitutional part includes each of enumerated constitutional parts for convenience. Thus, at least two constitutional parts of each constitutional part may be combined to form one constitutional part or one constitutional part may be divided into a plurality of constitutional parts to perform each function. The embodiment where each constitutional part is combined and the embodiment where one constitutional part is divided are also included in the scope of the present invention, if not departing from the essence of the present invention.

The terms used in the present specification are merely used to describe particular embodiments, and are not intended to limit the present invention. An expression used in the singular encompasses the expression of the plural, unless it has a clearly different meaning in the context. In the present specification, it is to be understood that terms such as “including”, “having”, etc. are intended to indicate the existence of the features, numbers, steps, actions, elements, parts, or combinations thereof disclosed in the specification, and are not intended to preclude the possibility that one or more other features, numbers, steps, actions, elements, parts, or combinations thereof may exist or may be added. In other words, when a specific element is referred to as being “included”, elements other than the corresponding element are not excluded, but additional elements may be included in embodiments of the present invention or the scope of the present invention.

In addition, some of constituents may not be indispensable constituents performing essential functions of the present invention but be selective constituents improving only performance thereof. The present invention may be implemented by including only the indispensable constitutional parts for implementing the essence of the present invention except the constituents used in improving performance. The structure including only the indispensable constituents except the selective constituents used in improving only performance is also included in the scope of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In describing exemplary embodiments of the present invention, well-known functions or constructions will not be described in detail since they may unnecessarily obscure the understanding of the present invention. The same constituent elements in the drawings are denoted by the same reference numerals, and a repeated description of the same elements will be omitted.

Hereinafter, an image may mean a picture configuring a video, or may mean the video itself. For example, “encoding or decoding or both of an image” may mean “encoding or decoding or both of a moving picture”, and may mean “encoding or decoding or both of one image among images of a moving picture.”

Hereinafter, terms “moving picture” and “video” may be used as the same meaning and be replaced with each other.

Hereinafter, a target image may be an encoding target image which is a target of encoding and/or a decoding target image which is a target of decoding. Also, a target image may be an input image inputted to an encoding apparatus, and an input image inputted to a decoding apparatus. Here, a target image may have the same meaning with the current image.

Hereinafter, terms “image”, “picture, “frame” and “screen” may be used as the same meaning and be replaced with each other.

Hereinafter, a target block may be an encoding target block which is a target of encoding and/or a decoding target block which is a target of decoding. Also, a target block may be the current block which is a target of current encoding and/or decoding. For example, terms “target block” and “current block” may be used as the same meaning and be replaced with each other.

Hereinafter, terms “block” and “unit” may be used as the same meaning and be replaced with each other. Or a “block” may represent a specific unit.

Hereinafter, terms “region” and “segment” may be replaced with each other.

Hereinafter, a specific signal may be a signal representing a specific block. For example, an original signal may be a signal representing a target block. A prediction signal may be a signal representing a prediction block. A residual signal may be a signal representing a residual block.

In embodiments, each of specific information, data, flag, index, element and attribute, etc. may have a value. A value of information, data, flag, index, element and attribute equal to “0” may represent a logical false or the first predefined value. In other words, a value “0”, a false, a logical false and the first predefined value may be replaced with each other. A value of information, data, flag, index, element and attribute equal to “1” may represent a logical true or the second predefined value. In other words, a value “1”, a true, a logical true and the second predefined value may be replaced with each other.

When a variable i or j is used for representing a column, a row or an index, a value of i may be an integer equal to or greater than 0, or equal to or greater than 1. That is, the column, the row, the index, etc. may be counted from 0 or may be counted from 1.

Description of Terms

Encoder: means an apparatus performing encoding. That is, means an encoding apparatus.

Decoder: means an apparatus performing decoding. That is, means an decoding apparatus.

Block: is an M×N array of a sample. Herein, M and N may mean positive integers, and the block may mean a sample array of a two-dimensional form. The block may refer to a unit. A current block my mean an encoding target block that becomes a target when encoding, or a decoding target block that becomes a target when decoding. In addition, the current block may be at least one of an encode block, a prediction block, a residual block, and a transform block.

Sample: is a basic unit constituting a block. It may be expressed as a value from 0 to 2Bd−1 according to a bit depth (Bd). In the present invention, the sample may be used as a meaning of a pixel. That is, a sample, a pel, a pixel may have the same meaning with each other.

Unit: may refer to an encoding and decoding unit. When encoding and decoding an image, the unit may be a region generated by partitioning a single image. In addition, the unit may mean a subdivided unit when a single image is partitioned into subdivided units during encoding or decoding. That is, an image may be partitioned into a plurality of units. When encoding and decoding an image, a predetermined process for each unit may be performed. A single unit may be partitioned into sub-units that have sizes smaller than the size of the unit. Depending on functions, the unit may mean a block, a macroblock, a coding tree unit, a code tree block, a coding unit, a coding block), a prediction unit, a prediction block, a residual unit), a residual block, a transform unit, a transform block, etc. In addition, in order to distinguish a unit from a block, the unit may include a luma component block, a chroma component block associated with the luma component block, and a syntax element of each color component block. The unit may have various sizes and forms, and particularly, the form of the unit may be a two-dimensional geometrical figure such as a square shape, a rectangular shape, a trapezoid shape, a triangular shape, a pentagonal shape, etc. In addition, unit information may include at least one of a unit type indicating the coding unit, the prediction unit, the transform unit, etc., and a unit size, a unit depth, a sequence of encoding and decoding of a unit, etc.

Coding Tree Unit: is configured with a single coding tree block of a luma component Y, and two coding tree blocks related to chroma components Cb and Cr. In addition, it may mean that including the blocks and a syntax element of each block. Each coding tree unit may be partitioned by using at least one of a quad-tree partitioning method, a binary-tree partitioning method and ternary-tree partitioning method to configure a lower unit such as coding unit, prediction unit, transform unit, etc. It may be used as a term for designating a sample block that becomes a process unit when encoding/decoding an image as an input image. Here, the quad-tree may mean a quaternary-tree.

When the size of the coding block is within a predetermined range, the division is possible using only quad-tree partitioning. Here, the predetermined range may be defined as at least one of a maximum size and a minimum size of a coding block in which the division is possible using only quad-tree partitioning. Information indicating a maximum/minimum size of a coding block in which quad-tree partitioning is allowed may be signaled through a bitstream, and the information may be signaled in at least one unit of a sequence, a picture parameter, a tile group, or a slice (segment). Alternatively, the maximum/minimum size of the coding block may be a fixed size predetermined in the coder/decoder. For example, when the size of the coding block corresponds to 256×256 to 64×64, the division is possible only using quad-tree partitioning. Alternatively, when the size of the coding block is larger than the size of the maximum conversion block, the division is possible only using quad-tree partitioning. Herein, the block to be divided may be at least one of a coding block and a transform block. In this case, information indicating the division of the coded block (for example, split_flag) may be a flag indicating whether or not to perform the quad-tree partitioning. When the size of the coding block falls within a predetermined range, the division is possible only using binary tree or ternary tree partitioning. In this case, the above description of the quad-tree partitioning may be applied to binary tree partitioning or ternary tree partitioning in the same manner.

Coding Tree Block: may be used as a term for designating any one of a Y coding tree block, Cb coding tree block, and Cr coding tree block.

Neighbor Block: may mean a block adjacent to a current block. The block adjacent to the current block may mean a block that comes into contact with a boundary of the current block, or a block positioned within a predetermined distance from the current block. The neighbor block may mean a block adjacent to a vertex of the current block. Herein, the block adjacent to the vertex of the current block may mean a block vertically adjacent to a neighbor block that is horizontally adjacent to the current block, or a block horizontally adjacent to a neighbor block that is vertically adjacent to the current block.

Reconstructed Neighbor block: may mean a neighbor block adjacent to a current block and which has been already spatially/temporally encoded or decoded. Herein, the reconstructed neighbor block may mean a reconstructed neighbor unit. A reconstructed spatial neighbor block may be a block within a current picture and which has been already reconstructed through encoding or decoding or both. A reconstructed temporal neighbor block is a block at a corresponding position as the current block of the current picture within a reference image, or a neighbor block thereof.

Unit Depth: may mean a partitioned degree of a unit. In a tree structure, the highest node(Root Node) may correspond to the first unit which is not partitioned. Also, the highest node may have the least depth value. In this case, the highest node may have a depth of level 0. A node having a depth of level 1 may represent a unit generated by partitioning once the first unit. A node having a depth of level 2 may represent a unit generated by partitioning twice the first unit. A node having a depth of level n may represent a unit generated by partitioning n-times the first unit. A Leaf Node may be the lowest node and a node which cannot be partitioned further. A depth of a Leaf Node may be the maximum level. For example, a predefined value of the maximum level may be 3. A depth of a root node may be the lowest and a depth of a leaf node may be the deepest. In addition, when a unit is expressed as a tree structure, a level in which a unit is present may mean a unit depth.

Bitstream: may mean a bitstream including encoding image information.

Parameter Set: corresponds to header information among a configuration within a bitstream. At least one of a video parameter set, a sequence parameter set, a picture parameter set, and an adaptation parameter set may be included in a parameter set. In addition, a parameter set may include a slice header, a tile group header, and tile header information. The term “tile group” means a group of tiles and has the same meaning as a slice.

The adaptation parameter set refers to a parameter set that can be shared and referred to by different pictures, subpictures, slices, tile groups, tiles, or bricks. In addition, sub-pictures, slices, tile groups, tiles, or bricks in a picture may refer to different adaptation parameter sets to use information in the different adaptation parameter sets.

Regarding the adaptation parameter sets, sub-pictures, slices, tile groups, tiles, or bricks in a picture may refer to different adaptation parameter sets by using identifiers of the respective adaptation parameter sets.

Regarding the adaptation parameter sets, slices, tile groups, tiles, or bricks in a sub-picture may refer to different adaptation parameter sets by using identifiers of the respective adaptation parameter sets.

Regarding the adaptation parameter sets, tiles or bricks in a slice may refer to different adaptation parameter sets by using identifiers of the respective adaptation parameter sets.

Regarding the adaptation parameter sets, bricks in a tile may refer to different adaptation parameter sets by using identifiers of the respective adaptation parameter sets.

The parameter set or header of a sub-picture may include information on an adaptation parameter set identifier. Thus, an adaptation parameter set corresponding to the adaptation parameter set identifier may be used in the sub-picture.

The parameter set or header of a tile may include an adaption parameter set identifier so that an adaption parameter set corresponding to the adaption parameter set identifier may be used in the tile.

The header of a brick may include information on an adaptation parameter set identifier so that an adaptation parameter set corresponding to the adaptation parameter set identifier may be used in the brick.

The picture may be split into one or more tile rows and one or more tile columns.

The sub-picture in a picture may be split into one or more tile rows and one or more tile columns. The sub-picture may be a rectangular or square region in a picture and may include one or more CTUs. The sub-picture may include at least one tile, brick, and/or slice.

The tile may be a rectangular or square region in a picture and may include one or more CTUs. The tile may be split into one or more bricks.

The brick may refer to one or more CTU rows in a tile. The tile may be split into one or more bricks, and each brick may have at least one CTU row. A tile that is not split into two or more bricks may also mean a brick.

The slice may include one or more tiles in a picture and may include one or more bricks in a tile.

Parsing: may mean determination of a value of a syntax element by performing entropy decoding, or may mean the entropy decoding itself.

Symbol: may mean at least one of a syntax element, a coding parameter, and a transform coefficient value of an encoding/decoding target unit. In addition, the symbol may mean an entropy encoding target or an entropy decoding result.

Prediction Mode: may be information indicating a mode encoded/decoded with intra prediction or a mode encoded/decoded with inter prediction.

Prediction Unit: may mean a basic unit when performing prediction such as inter-prediction, intra-prediction, inter-compensation, intra-compensation, and motion compensation. A single prediction unit may be partitioned into a plurality of partitions having a smaller size, or may be partitioned into a plurality of lower prediction units. A plurality of partitions may be a basic unit in performing prediction or compensation. A partition which is generated by dividing a prediction unit may also be a prediction unit.

Prediction Unit Partition: may mean a form obtained by partitioning a prediction unit.

Reference picture list may refer to a list including one or more reference pictures used for inter prediction or motion compensation. There are several types of usable reference picture lists, including LC (List combined), L0 (List 0), L1 (List 1), L2 (List 2), L3 (List 3).

Inter prediction indicator may refer to a direction of inter prediction (unidirectional prediction, bidirectional prediction, etc.) of a current block. Alternatively, it may refer to the number of reference pictures used to generate a prediction block of a current block. Alternatively, it may refer to the number of prediction blocks used at the time of performing inter prediction or motion compensation on a current block.

Prediction list utilization flag indicates whether a prediction block is generated using at least one reference picture in a specific reference picture list. An inter prediction indicator can be derived using a prediction list utilization flag, and conversely, a prediction list utilization flag can be derived using an inter prediction indicator. For example, when the prediction list utilization flag has a first value of zero (0), it means that a reference picture in a reference picture list is not used to generate a prediction block. On the other hand, when the prediction list utilization flag has a second value of one (1), it means that a reference picture list is used to generate a prediction block.

Reference picture index may refer to an index indicating a specific reference picture in a reference picture list.

Reference picture may mean a reference picture which is referred to by a specific block for the purposes of inter prediction or motion compensation of the specific block. Alternatively, the reference picture may be a picture including a reference block referred to by a current block for inter prediction or motion compensation. Hereinafter, the terms “reference picture” and “reference image” have the same meaning and can be interchangeably.

Motion vector may be a two-dimensional vector used for inter prediction or motion compensation. The motion vector may mean an offset between an encoding/decoding target block and a reference block. For example, (mvX, mvY) may represent a motion vector. Here, mvX may represent a horizontal component and mvY may represent a vertical component.

Search range may be a two-dimensional region which is searched to retrieve a motion vector during inter prediction. For example, the size of the search range may be M×N. Here, M and N are both integers.

Motion vector candidate may refer to a prediction candidate block or a motion vector of the prediction candidate block when predicting a motion vector. In addition, a motion vector candidate may be included in a motion vector candidate list.

Motion vector candidate list may mean a list composed of one or more motion vector candidates.

Motion vector candidate index may mean an indicator indicating a motion vector candidate in a motion vector candidate list. Alternatively, it may be an index of a motion vector predictor.

Motion information may mean information including at least one of the items including a motion vector, a reference picture index, an inter prediction indicator, a prediction list utilization flag, reference picture list information, a reference picture, a motion vector candidate, a motion vector candidate index, a merge candidate, and a merge index.

Merge candidate list may mean a list composed of one or more merge candidates.

Merge candidate may mean a spatial merge candidate, a temporal merge candidate, a combined merge candidate, a combined bi-predictive merge candidate, or a zero merge candidate. The merge candidate may include motion information such as an inter prediction indicator, a reference picture index for each list, a motion vector, a prediction list utilization flag, and an inter prediction indicator.

Merge index may mean an indicator indicating a merge candidate in a merge candidate list. Alternatively, the merge index may indicate a block from which a merge candidate has been derived, among reconstructed blocks spatially/temporally adjacent to a current block. Alternatively, the merge index may indicate at least one piece of motion information of a merge candidate.

Transform Unit: may mean a basic unit when performing encoding/decoding such as transform, inverse-transform, quantization, dequantization, transform coefficient encoding/decoding of a residual signal. A single transform unit may be partitioned into a plurality of lower-level transform units having a smaller size. Here, transformation/inverse-transformation may comprise at least one among the first transformation/the first inverse-transformation and the second transformation/the second inverse-transformation.

Scaling: may mean a process of multiplying a quantized level by a factor. A transform coefficient may be generated by scaling a quantized level. The scaling also may be referred to as dequantization.

Quantization Parameter: may mean a value used when generating a quantized level using a transform coefficient during quantization. The quantization parameter also may mean a value used when generating a transform coefficient by scaling a quantized level during dequantization. The quantization parameter may be a value mapped on a quantization step size.

Delta Quantization Parameter: may mean a difference value between a predicted quantization parameter and a quantization parameter of an encoding/decoding target unit.

Scan: may mean a method of sequencing coefficients within a unit, a block or a matrix. For example, changing a two-dimensional matrix of coefficients into a one-dimensional matrix may be referred to as scanning, and changing a one-dimensional matrix of coefficients into a two-dimensional matrix may be referred to as scanning or inverse scanning.

Transform Coefficient: may mean a coefficient value generated after transform is performed in an encoder. It may mean a coefficient value generated after at least one of entropy decoding and dequantization is performed in a decoder. A quantized level obtained by quantizing a transform coefficient or a residual signal, or a quantized transform coefficient level also may fall within the meaning of the transform coefficient.

Quantized Level: may mean a value generated by quantizing a transform coefficient or a residual signal in an encoder. Alternatively, the quantized level may mean a value that is a dequantization target to undergo dequantization in a decoder. Similarly, a quantized transform coefficient level that is a result of transform and quantization also may fall within the meaning of the quantized level.

Non-zero Transform Coefficient: may mean a transform coefficient having a value other than zero, or a transform coefficient level or a quantized level having a value other than zero.

Quantization Matrix: may mean a matrix used in a quantization process or a dequantization process performed to improve subjective or objective image quality. The quantization matrix also may be referred to as a scaling list.

Quantization Matrix Coefficient: may mean each element within a quantization matrix. The quantization matrix coefficient also may be referred to as a matrix coefficient.

Default Matrix: may mean a predetermined quantization matrix preliminarily defined in an encoder or a decoder.

Non-default Matrix: may mean a quantization matrix that is not preliminarily defined in an encoder or a decoder but is signaled by a user.

Statistic Value: a statistic value for at least one among a variable, a coding parameter, a constant value, etc. which have a computable specific value may be one or more among an average value, a sum value, a weighted average value, a weighted sum value, the minimum value, the maximum value, the most frequent value, a median value, an interpolated value of the corresponding specific values.

FIG. 1 is a block diagram showing a configuration of an encoding apparatus according to an embodiment to which the present invention is applied.

An encoding apparatus 100 may be an encoder, a video encoding apparatus, or an image encoding apparatus. A video may include at least one image. The encoding apparatus 100 may sequentially encode at least one image.

Referring to FIG. 1 , the encoding apparatus 100 may include a motion prediction unit 111, a motion compensation unit 112, an intra-prediction unit 120, a switch 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy encoding unit 150, a dequantization unit 160, an inverse-transform unit 170, an adder 175, a filter unit 180, and a reference picture buffer 190.

The encoding apparatus 100 may perform encoding of an input image by using an intra mode or an inter mode or both. In addition, encoding apparatus 100 may generate a bitstream including encoded information through encoding the input image, and output the generated bitstream. The generated bitstream may be stored in a computer readable recording medium, or may be streamed through a wired/wireless transmission medium. When an intra mode is used as a prediction mode, the switch 115 may be switched to an intra. Alternatively, when an inter mode is used as a prediction mode, the switch 115 may be switched to an inter mode. Herein, the intra mode may mean an intra-prediction mode, and the inter mode may mean an inter-prediction mode. The encoding apparatus 100 may generate a prediction block for an input block of the input image. In addition, the encoding apparatus 100 may encode a residual block using a residual of the input block and the prediction block after the prediction block being generated. The input image may be called as a current image that is a current encoding target. The input block may be called as a current block that is current encoding target, or as an encoding target block.

When a prediction mode is an intra mode, the intra-prediction unit 120 may use a sample of a block that has been already encoded/decoded and is adjacent to a current block as a reference sample. The intra-prediction unit 120 may perform spatial prediction for the current block by using a reference sample, or generate prediction samples of an input block by performing spatial prediction. Herein, the intra prediction may mean intra-prediction,

When a prediction mode is an inter mode, the motion prediction unit 111 may retrieve a region that best matches with an input block from a reference image when performing motion prediction, and deduce a motion vector by using the retrieved region. In this case, a search region may be used as the region. The reference image may be stored in the reference picture buffer 190. Here, when encoding/decoding for the reference image is performed, it may be stored in the reference picture buffer 190.

The motion compensation unit 112 may generate a prediction block by performing motion compensation for the current block using a motion vector. Herein, inter-prediction may mean inter-prediction or motion compensation.

When the value of the motion vector is not an integer, the motion prediction unit 111 and the motion compensation unit 112 may generate the prediction block by applying an interpolation filter to a partial region of the reference picture. In order to perform inter-picture prediction or motion compensation on a coding unit, it may be determined that which mode among a skip mode, a merge mode, an advanced motion vector prediction (AMVP) mode, and a current picture referring mode is used for motion prediction and motion compensation of a prediction unit included in the corresponding coding unit. Then, inter-picture prediction or motion compensation may be differently performed depending on the determined mode.

The subtractor 125 may generate a residual block by using a difference of an input block and a prediction block. The residual block may be called as a residual signal. The residual signal may mean a difference between an original signal and a prediction signal. In addition, the residual signal may be a signal generated by transforming or quantizing, or transforming and quantizing a difference between the original signal and the prediction signal. The residual block may be a residual signal of a block unit.

The transform unit 130 may generate a transform coefficient by performing transform of a residual block, and output the generated transform coefficient. Herein, the transform coefficient may be a coefficient value generated by performing transform of the residual block. When a transform skip mode is applied, the transform unit 130 may skip transform of the residual block.

A quantized level may be generated by applying quantization to the transform coefficient or to the residual signal. Hereinafter, the quantized level may be also called as a transform coefficient in embodiments.

The quantization unit 140 may generate a quantized level by quantizing the transform coefficient or the residual signal according to a parameter, and output the generated quantized level. Herein, the quantization unit 140 may quantize the transform coefficient by using a quantization matrix.

The entropy encoding unit 150 may generate a bitstream by performing entropy encoding according to a probability distribution on values calculated by the quantization unit 140 or on coding parameter values calculated when performing encoding, and output the generated bitstream. The entropy encoding unit 150 may perform entropy encoding of sample information of an image and information for decoding an image. For example, the information for decoding the image may include a syntax element.

When entropy encoding is applied, symbols are represented so that a smaller number of bits are assigned to a symbol having a high chance of being generated and a larger number of bits are assigned to a symbol having a low chance of being generated, and thus, the size of bit stream for symbols to be encoded may be decreased. The entropy encoding unit 150 may use an encoding method for entropy encoding such as exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), etc. For example, the entropy encoding unit 150 may perform entropy encoding by using a variable length coding/code (VLC) table. In addition, the entropy encoding unit 150 may deduce a binarization method of a target symbol and a probability model of a target symbol/bin, and perform arithmetic coding by using the deduced binarization method, and a context model.

In order to encode a transform coefficient level(quantized level), the entropy encoding unit 150 may change a two-dimensional block form coefficient into a one-dimensional vector form by using a transform coefficient scanning method.

A coding parameter may include information (flag, index, etc.) such as syntax element that is encoded in an encoder and signaled to a decoder, and information derived when performing encoding or decoding. The coding parameter may mean information required when encoding or decoding an image. For example, at least one value or a combination form of a unit/block size, a unit/block depth, unit/block partition information, unit/block shape, unit/block partition structure, whether to partition of a quad-tree form, whether to partition of a binary-tree form, a partition direction of a binary-tree form (horizontal direction or vertical direction), a partition form of a binary-tree form (symmetric partition or asymmetric partition), whether or not a current coding unit is partitioned by ternary tree partitioning, direction (horizontal or vertical direction) of the ternary tree partitioning, type (symmetric or asymmetric type) of the ternary tree partitioning, whether a current coding unit is partitioned by multi-type tree partitioning, direction (horizontal or vertical direction) of the multi-type three partitioning, type (symmetric or asymmetric type) of the multi-type tree partitioning, and a tree (binary tree or ternary tree) structure of the multi-type tree partitioning, a prediction mode(intra prediction or inter prediction), a luma intra-prediction mode/direction, a chroma intra-prediction mode/direction, intra partition information, inter partition information, a coding block partition flag, a prediction block partition flag, a transform block partition flag, a reference sample filtering method, a reference sample filter tab, a reference sample filter coefficient, a prediction block filtering method, a prediction block filter tap, a prediction block filter coefficient, a prediction block boundary filtering method, a prediction block boundary filter tab, a prediction block boundary filter coefficient, an intra-prediction mode, an inter-prediction mode, motion information, a motion vector, a motion vector difference, a reference picture index, a inter-prediction angle, an inter-prediction indicator, a prediction list utilization flag, a reference picture list, a reference picture, a motion vector predictor index, a motion vector predictor candidate, a motion vector candidate list, whether to use a merge mode, a merge index, a merge candidate, a merge candidate list, whether to use a skip mode, an interpolation filter type, an interpolation filter tab, an interpolation filter coefficient, a motion vector size, a presentation accuracy of a motion vector, a transform type, a transform size, information of whether or not a primary(first) transform is used, information of whether or not a secondary transform is used, a primary transform index, a secondary transform index, information of whether or not a residual signal is present, a coded block pattern, a coded block flag (CBF), a quantization parameter, a quantization parameter residue, a quantization matrix, whether to apply an intra loop filter, an intra loop filter coefficient, an intra loop filter tab, an intra loop filter shape/form, whether to apply a deblocking filter, a deblocking filter coefficient, a deblocking filter tab, a deblocking filter strength, a deblocking filter shape/form, whether to apply an adaptive sample offset, an adaptive sample offset value, an adaptive sample offset category, an adaptive sample offset type, whether to apply an adaptive loop filter, an adaptive loop filter coefficient, an adaptive loop filter tab, an adaptive loop filter shape/form, a binarization/inverse-binarization method, a context model determining method, a context model updating method, whether to perform a regular mode, whether to perform a bypass mode, a context bin, a bypass bin, a significant coefficient flag, a last significant coefficient flag, a coded flag for a unit of a coefficient group, a position of the last significant coefficient, a flag for whether a value of a coefficient is larger than 1, a flag for whether a value of a coefficient is larger than 2, a flag for whether a value of a coefficient is larger than 3, information on a remaining coefficient value, a sign information, a reconstructed luma sample, a reconstructed chroma sample, a residual luma sample, a residual chroma sample, a luma transform coefficient, a chroma transform coefficient, a quantized luma level, a quantized chroma level, a transform coefficient level scanning method, a size of a motion vector search area at a decoder side, a shape of a motion vector search area at a decoder side, a number of time of a motion vector search at a decoder side, information on a CTU size, information on a minimum block size, information on a maximum block size, information on a maximum block depth, information on a minimum block depth, an image displaying/outputting sequence, slice identification information, a slice type, slice partition information, tile identification information, a tile type, tile partition information, tile group identification information, a tile group type, tile group partition information, a picture type, a bit depth of an input sample, a bit depth of a reconstruction sample, a bit depth of a residual sample, a bit depth of a transform coefficient, a bit depth of a quantized level, and information on a luma signal or information on a chroma signal may be included in the coding parameter.

Herein, signaling the flag or index may mean that a corresponding flag or index is entropy encoded and included in a bitstream by an encoder, and may mean that the corresponding flag or index is entropy decoded from a bitstream by a decoder.

When the encoding apparatus 100 performs encoding through inter-prediction, an encoded current image may be used as a reference image for another image that is processed afterwards. Accordingly, the encoding apparatus 100 may reconstruct or decode the encoded current image, or store the reconstructed or decoded image as a reference image in reference picture buffer 190.

A quantized level may be dequantized in the dequantization unit 160, or may be inverse-transformed in the inverse-transform unit 170. A dequantized or inverse-transformed coefficient or both may be added with a prediction block by the adder 175. By adding the dequantized or inverse-transformed coefficient or both with the prediction block, a reconstructed block may be generated. Herein, the dequantized or inverse-transformed coefficient or both may mean a coefficient on which at least one of dequantization and inverse-transform is performed, and may mean a reconstructed residual block.

A reconstructed block may pass through the filter unit 180. The filter unit 180 may apply at least one of a deblocking filter, a sample adaptive offset (SAO), and an adaptive loop filter (ALF) to a reconstructed sample, a reconstructed block or a reconstructed image. The filter unit 180 may be called as an in-loop filter.

The deblocking filter may remove block distortion generated in boundaries between blocks. In order to determine whether or not to apply a deblocking filter, whether or not to apply a deblocking filter to a current block may be determined based samples included in several rows or columns which are included in the block. When a deblocking filter is applied to a block, another filter may be applied according to a required deblocking filtering strength.

In order to compensate an encoding error, a proper offset value may be added to a sample value by using a sample adaptive offset. The sample adaptive offset may correct an offset of a deblocked image from an original image by a sample unit. A method of partitioning samples of an image into a predetermined number of regions, determining a region to which an offset is applied, and applying the offset to the determined region, or a method of applying an offset in consideration of edge information on each sample may be used.

The adaptive loop filter may perform filtering based on a comparison result of the filtered reconstructed image and the original image. Samples included in an image may be partitioned into predetermined groups, a filter to be applied to each group may be determined, and differential filtering may be performed for each group. Information of whether or not to apply the ALF may be signaled by coding units (CUs), and a form and coefficient of the ALF to be applied to each block may vary.

The reconstructed block or the reconstructed image having passed through the filter unit 180 may be stored in the reference picture buffer 190. A reconstructed block processed by the filter unit 180 may be a part of a reference image. That is, a reference image is a reconstructed image composed of reconstructed blocks processed by the filter unit 180. The stored reference image may be used later in inter prediction or motion compensation.

FIG. 2 is a block diagram showing a configuration of a decoding apparatus according to an embodiment and to which the present invention is applied.

A decoding apparatus 200 may a decoder, a video decoding apparatus, or an image decoding apparatus.

Referring to FIG. 2 , the decoding apparatus 200 may include an entropy decoding unit 210, a dequantization unit 220, an inverse-transform unit 230, an intra-prediction unit 240, a motion compensation unit 250, an adder 225, a filter unit 260, and a reference picture buffer 270.

The decoding apparatus 200 may receive a bitstream output from the encoding apparatus 100. The decoding apparatus 200 may receive a bitstream stored in a computer readable recording medium, or may receive a bitstream that is streamed through a wired/wireless transmission medium. The decoding apparatus 200 may decode the bitstream by using an intra mode or an inter mode. In addition, the decoding apparatus 200 may generate a reconstructed image generated through decoding or a decoded image, and output the reconstructed image or decoded image.

When a prediction mode used when decoding is an intra mode, a switch may be switched to an intra. Alternatively, when a prediction mode used when decoding is an inter mode, a switch may be switched to an inter mode.

The decoding apparatus 200 may obtain a reconstructed residual block by decoding the input bitstream, and generate a prediction block. When the reconstructed residual block and the prediction block are obtained, the decoding apparatus 200 may generate a reconstructed block that becomes a decoding target by adding the reconstructed residual block with the prediction block. The decoding target block may be called a current block.

The entropy decoding unit 210 may generate symbols by entropy decoding the bitstream according to a probability distribution. The generated symbols may include a symbol of a quantized level form. Herein, an entropy decoding method may be an inverse-process of the entropy encoding method described above.

In order to decode a transform coefficient level(quantized level), the entropy decoding unit 210 may change a one-directional vector form coefficient into a two-dimensional block form by using a transform coefficient scanning method.

A quantized level may be dequantized in the dequantization unit 220, or inverse-transformed in the inverse-transform unit 230. The quantized level may be a result of dequantizing or inverse-transforming or both, and may be generated as a reconstructed residual block. Herein, the dequantization unit 220 may apply a quantization matrix to the quantized level.

When an intra mode is used, the intra-prediction unit 240 may generate a prediction block by performing, for the current block, spatial prediction that uses a sample value of a block adjacent to a decoding target block and which has been already decoded.

When an inter mode is used, the motion compensation unit 250 may generate a prediction block by performing, for the current block, motion compensation that uses a motion vector and a reference image stored in the reference picture buffer 270.

The adder 225 may generate a reconstructed block by adding the reconstructed residual block with the prediction block. The filter unit 260 may apply at least one of a deblocking filter, a sample adaptive offset, and an adaptive loop filter to the reconstructed block or reconstructed image. The filter unit 260 may output the reconstructed image. The reconstructed block or reconstructed image may be stored in the reference picture buffer 270 and used when performing inter-prediction. A reconstructed block processed by the filter unit 260 may be a part of a reference image. That is, a reference image is a reconstructed image composed of reconstructed blocks processed by the filter unit 260. The stored reference image may be used later in inter prediction or motion compensation.

FIG. 3 is a view schematically showing a partition structure of an image when encoding and decoding the image. FIG. 3 schematically shows an example of partitioning a single unit into a plurality of lower units.

In order to efficiently partition an image, when encoding and decoding, a coding unit (CU) may be used. The coding unit may be used as a basic unit when encoding/decoding the image. In addition, the coding unit may be used as a unit for distinguishing an intra prediction mode and an inter prediction mode when encoding/decoding the image. The coding unit may be a basic unit used for prediction, transform, quantization, inverse-transform, dequantization, or an encoding/decoding process of a transform coefficient.

Referring to FIG. 3 , an image 300 is sequentially partitioned in a largest coding unit (LCU), and a LCU unit is determined as a partition structure. Herein, the LCU may be used in the same meaning as a coding tree unit (CTU). A unit partitioning may mean partitioning a block associated with to the unit. In block partition information, information of a unit depth may be included. Depth information may represent a number of times or a degree or both in which a unit is partitioned. A single unit may be partitioned into a plurality of lower level units hierarchically associated with depth information based on a tree structure. In other words, a unit and a lower level unit generated by partitioning the unit may correspond to a node and a child node of the node, respectively. Each of partitioned lower unit may have depth information. Depth information may be information representing a size of a CU, and may be stored in each CU. Unit depth represents times and/or degrees related to partitioning a unit. Therefore, partitioning information of a lower-level unit may comprise information on a size of the lower-level unit.

A partition structure may mean a distribution of a coding unit (CU) within an LCU 310. Such a distribution may be determined according to whether or not to partition a single CU into a plurality (positive integer equal to or greater than 2 including 2, 4, 8, 16, etc.) of CUs. A horizontal size and a vertical size of the CU generated by partitioning may respectively be half of a horizontal size and a vertical size of the CU before partitioning, or may respectively have sizes smaller than a horizontal size and a vertical size before partitioning according to a number of times of partitioning. The CU may be recursively partitioned into a plurality of CUs. By the recursive partitioning, at least one among a height and a width of a CU after partitioning may decrease comparing with at least one among a height and a width of a CU before partitioning. Partitioning of the CU may be recursively performed until to a predefined depth or predefined size. For example, a depth of an LCU may be 0, and a depth of a smallest coding unit (SCU) may be a predefined maximum depth. Herein, the LCU may be a coding unit having a maximum coding unit size, and the SCU may be a coding unit having a minimum coding unit size as described above. Partitioning is started from the LCU 310, a CU depth increases by 1 as a horizontal size or a vertical size or both of the CU decreases by partitioning. For example, for each depth, a CU which is not partitioned may have a size of 2N×2N. Also, in case of a CU which is partitioned, a CU with a size of 2N×2N may be partitioned into four CUs with a size of N×N. A size of N may decrease to half as a depth increase by 1.

In addition, information whether or not the CU is partitioned may be represented by using partition information of the CU. The partition information may be 1-bit information. All CUs, except for a SCU, may include partition information. For example, when a value of partition information is a first value, the CU may not be partitioned, when a value of partition information is a second value, the CU may be partitioned

Referring to FIG. 3 , an LCU having a depth 0 may be a 64×64 block. 0 may be a minimum depth. A SCU having a depth 3 may be an 8×8 block. 3 may be a maximum depth. A CU of a 32×32 block and a 16×16 block may be respectively represented as a depth 1 and a depth 2.

For example, when a single coding unit is partitioned into four coding units, a horizontal size and a vertical size of the four partitioned coding units may be a half size of a horizontal and vertical size of the CU before being partitioned. In one embodiment, when a coding unit having a 32×32 size is partitioned into four coding units, each of the four partitioned coding units may have a 16×16 size. When a single coding unit is partitioned into four coding units, it may be called that the coding unit may be partitioned into a quad-tree form.

For example, when one coding unit is partitioned into two sub-coding units, the horizontal or vertical size (width or height) of each of the two sub-coding units may be half the horizontal or vertical size of the original coding unit. For example, when a coding unit having a size of 32×32 is vertically partitioned into two sub-coding units, each of the two sub-coding units may have a size of 16×32. For example, when a coding unit having a size of 8×32 is horizontally partitioned into two sub-coding units, each of the two sub-coding units may have a size of 8×16. When one coding unit is partitioned into two sub-coding units, it can be said that the coding unit is binary-partitioned or is partitioned by a binary tree partition structure.

For example, when one coding unit is partitioned into three sub-coding units, the horizontal or vertical size of the coding unit can be partitioned with a ratio of 1:2:1, thereby producing three sub-coding units whose horizontal or vertical sizes are in a ratio of 1:2:1. For example, when a coding unit having a size of 16×32 is horizontally partitioned into three sub-coding units, the three sub-coding units may have sizes of 16×8, 16×16, and 16×8 respectively, in the order from the uppermost to the lowermost sub-coding unit. For example, when a coding unit having a size of 32×32 is vertically split into three sub-coding units, the three sub-coding units may have sizes of 8×32, 16×32, and 8×32, respectively in the order from the left to the right sub-coding unit. When one coding unit is partitioned into three sub-coding units, it can be said that the coding unit is ternary-partitioned or partitioned by a ternary tree partition structure.

In FIG. 3 , a coding tree unit (CTU) 320 is an example of a CTU to which a quad tree partition structure, a binary tree partition structure, and a ternary tree partition structure are all applied.

As described above, in order to partition the CTU, at least one of a quad tree partition structure, a binary tree partition structure, and a ternary tree partition structure may be applied. Various tree partition structures may be sequentially applied to the CTU, according to a predetermined priority order. For example, the quad tree partition structure may be preferentially applied to the CTU. A coding unit that cannot be partitioned any longer using a quad tree partition structure may correspond to a leaf node of a quad tree. A coding unit corresponding to a leaf node of a quad tree may serve as a root node of a binary and/or ternary tree partition structure. That is, a coding unit corresponding to a leaf node of a quad tree may be further partitioned by a binary tree partition structure or a ternary tree partition structure, or may not be further partitioned. Therefore, by preventing a coding block that results from binary tree partitioning or ternary tree partitioning of a coding unit corresponding to a leaf node of a quad tree from undergoing further quad tree partitioning, block partitioning and/or signaling of partition information can be effectively performed.

The fact that a coding unit corresponding to a node of a quad tree is partitioned may be signaled using quad partition information. The quad partition information having a first value (e.g., “1”) may indicate that a current coding unit is partitioned by the quad tree partition structure. The quad partition information having a second value (e.g., “C”) may indicate that a current coding unit is not partitioned by the quad tree partition structure. The quad partition information may be a flag having a predetermined length (e.g., one bit).

There may not be a priority between the binary tree partitioning and the ternary tree partitioning. That is, a coding unit corresponding to a leaf node of a quad tree may further undergo arbitrary partitioning among the binary tree partitioning and the ternary tree partitioning. In addition, a coding unit generated through the binary tree partitioning or the ternary tree partitioning may undergo a further binary tree partitioning or a further ternary tree partitioning, or may not be further partitioned.

A tree structure in which there is no priority among the binary tree partitioning and the ternary tree partitioning is referred to as a multi-type tree structure. A coding unit corresponding to a leaf node of a quad tree may serve as a root node of a multi-type tree. Whether to partition a coding unit which corresponds to a node of a multi-type tree may be signaled using at least one of multi-type tree partition indication information, partition direction information, and partition tree information. For partitioning of a coding unit corresponding to a node of a multi-type tree, the multi-type tree partition indication information, the partition direction, and the partition tree information may be sequentially signaled.

The multi-type tree partition indication information having a first value (e.g., “1”) may indicate that a current coding unit is to undergo a multi-type tree partitioning. The multi-type tree partition indication information having a second value (e.g., “0”) may indicate that a current coding unit is not to undergo a multi-type tree partitioning.

When a coding unit corresponding to a node of a multi-type tree is further partitioned by a multi-type tree partition structure, the coding unit may include partition direction information. The partition direction information may indicate in which direction a current coding unit is to be partitioned for the multi-type tree partitioning. The partition direction information having a first value (e.g., “1”) may indicate that a current coding unit is to be vertically partitioned. The partition direction information having a second value (e.g., “0”) may indicate that a current coding unit is to be horizontally partitioned.

When a coding unit corresponding to a node of a multi-type tree is further partitioned by a multi-type tree partition structure, the current coding unit may include partition tree information. The partition tree information may indicate a tree partition structure which is to be used for partitioning of a node of a multi-type tree. The partition tree information having a first value (e.g., “1”) may indicate that a current coding unit is to be partitioned by a binary tree partition structure. The partition tree information having a second value (e.g., “0”) may indicate that a current coding unit is to be partitioned by a ternary tree partition structure.

The partition indication information, the partition tree information, and the partition direction information may each be a flag having a predetermined length (e.g., one bit).

At least any one of the quadtree partition indication information, the multi-type tree partition indication information, the partition direction information, and the partition tree information may be entropy encoded/decoded. For the entropy-encoding/decoding of those types of information, information on a neighboring coding unit adjacent to the current coding unit may be used. For example, there is a high probability that the partition type (the partitioned or non-partitioned, the partition tree, and/or the partition direction) of a left neighboring coding unit and/or an upper neighboring coding unit of a current coding unit is similar to that of the current coding unit. Therefore, context information for entropy encoding/decoding of the information on the current coding unit may be derived from the information on the neighboring coding units. The information on the neighboring coding units may include at least any one of quad partition information, multi-type tree partition indication information, partition direction information, and partition tree information.

As another example, among binary tree partitioning and ternary tree partitioning, binary tree partitioning may be preferentially performed. That is, a current coding unit may primarily undergo binary tree partitioning, and then a coding unit corresponding to a leaf node of a binary tree may be set as a root node for ternary tree partitioning. In this case, neither quad tree partitioning nor binary tree partitioning may not be performed on the coding unit corresponding to a node of a ternary tree.

A coding unit that cannot be partitioned by a quad tree partition structure, a binary tree partition structure, and/or a ternary tree partition structure becomes a basic unit for coding, prediction and/or transformation. That is, the coding unit cannot be further partitioned for prediction and/or transformation. Therefore, the partition structure information and the partition information used for partitioning a coding unit into prediction units and/or transformation units may not be present in a bit stream.

However, when the size of a coding unit (i.e., a basic unit for partitioning) is larger than the size of a maximum transformation block, the coding unit may be recursively partitioned until the size of the coding unit is reduced to be equal to or smaller than the size of the maximum transformation block. For example, when the size of a coding unit is 64×64 and when the size of a maximum transformation block is 32×32, the coding unit may be partitioned into four 32×32 blocks for transformation. For example, when the size of a coding unit is 32×64 and the size of a maximum transformation block is 32×32, the coding unit may be partitioned into two 32×32 blocks for the transformation. In this case, the partitioning of the coding unit for transformation is not signaled separately, and may be determined through comparison between the horizontal or vertical size of the coding unit and the horizontal or vertical size of the maximum transformation block. For example, when the horizontal size (width) of the coding unit is larger than the horizontal size (width) of the maximum transformation block, the coding unit may be vertically bisected. For example, when the vertical size (length) of the coding unit is larger than the vertical size (length) of the maximum transformation block, the coding unit may be horizontally bisected.

Information of the maximum and/or minimum size of the coding unit and information of the maximum and/or minimum size of the transformation block may be signaled or determined at an upper level of the coding unit. The upper level may be, for example, a sequence level, a picture level, a slice level, a tile group level, a tile level, or the like. For example, the minimum size of the coding unit may be determined to be 4×4. For example, the maximum size of the transformation block may be determined to be 64×64. For example, the minimum size of the transformation block may be determined to be 4×4.

Information of the minimum size (quad tree minimum size) of a coding unit corresponding to a leaf node of a quad tree and/or information of the maximum depth (the maximum tree depth of a multi-type tree) from a root node to a leaf node of the multi-type tree may be signaled or determined at an upper level of the coding unit. For example, the upper level may be a sequence level, a picture level, a slice level, a tile group level, a tile level, or the like. Information of the minimum size of a quad tree and/or information of the maximum depth of a multi-type tree may be signaled or determined for each of an intra-picture slice and an inter-picture slice.

Difference information between the size of a CTU and the maximum size of a transformation block may be signaled or determined at an upper level of the coding unit. For example, the upper level may be a sequence level, a picture level, a slice level, a tile group level, a tile level, or the like. Information of the maximum size of the coding units corresponding to the respective nodes of a binary tree (hereinafter, referred to as a maximum size of a binary tree) may be determined based on the size of the coding tree unit and the difference information. The maximum size of the coding units corresponding to the respective nodes of a ternary tree (hereinafter, referred to as a maximum size of a ternary tree) may vary depending on the type of slice. For example, for an intra-picture slice, the maximum size of a ternary tree may be 32×32. For example, for an inter-picture slice, the maximum size of a ternary tree may be 128×128. For example, the minimum size of the coding units corresponding to the respective nodes of a binary tree (hereinafter, referred to as a minimum size of a binary tree) and/or the minimum size of the coding units corresponding to the respective nodes of a ternary tree (hereinafter, referred to as a minimum size of a ternary tree) may be set as the minimum size of a coding block.

As another example, the maximum size of a binary tree and/or the maximum size of a ternary tree may be signaled or determined at the slice level. Alternatively, the minimum size of the binary tree and/or the minimum size of the ternary tree may be signaled or determined at the slice level.

Depending on size and depth information of the above-described various blocks, quad partition information, multi-type tree partition indication information, partition tree information and/or partition direction information may be included or may not be included in a bit stream.

For example, when the size of the coding unit is not larger than the minimum size of a quad tree, the coding unit does not contain quad partition information. Thus, the quad partition information may be deduced from a second value.

For example, when the sizes (horizontal and vertical sizes) of a coding unit corresponding to a node of a multi-type tree are larger than the maximum sizes (horizontal and vertical sizes) of a binary tree and/or the maximum sizes (horizontal and vertical sizes) of a ternary tree, the coding unit may not be binary-partitioned or ternary-partitioned. Accordingly, the multi-type tree partition indication information may not be signaled but may be deduced from a second value.

Alternatively, when the sizes (horizontal and vertical sizes) of a coding unit corresponding to a node of a multi-type tree are the same as the maximum sizes (horizontal and vertical sizes) of a binary tree and/or are two times as large as the maximum sizes (horizontal and vertical sizes) of a ternary tree, the coding unit may not be further binary-partitioned or ternary-partitioned. Accordingly, the multi-type tree partition indication information may not be signaled but be derived from a second value. This is because when a coding unit is partitioned by a binary tree partition structure and/or a ternary tree partition structure, a coding unit smaller than the minimum size of a binary tree and/or the minimum size of a ternary tree is generated.

Alternatively, the binary tree partitioning or the ternary tree partitioning may be limited on the basis of the size of a virtual pipeline data unit (hereinafter, a pipeline buffer size). For example, when the coding unit is divided into sub-coding units which do not fit the pipeline buffer size by the binary tree partitioning or the ternary tree partitioning, the corresponding binary tree partitioning or ternary tree partitioning may be limited. The pipeline buffer size may be the size of the maximum transform block (e.g., 64×64). For example, when the pipeline buffer size is 64×64, the division below may be limited.

-   -   N×M (N and/or M is 128) Ternary tree partitioning for coding         units     -   128×N (N<=64) Binary tree partitioning in horizontal direction         for coding units     -   N×128 (N<=64) Binary tree partitioning in vertical direction for         coding units

Alternatively, when the depth of a coding unit corresponding to a node of a multi-type tree is equal to the maximum depth of the multi-type tree, the coding unit may not be further binary-partitioned and/or ternary-partitioned. Accordingly, the multi-type tree partition indication information may not be signaled but may be deduced from a second value.

Alternatively, only when at least one of vertical direction binary tree partitioning, horizontal direction binary tree partitioning, vertical direction ternary tree partitioning, and horizontal direction ternary tree partitioning is possible for a coding unit corresponding to a node of a multi-type tree, the multi-type tree partition indication information may be signaled. Otherwise, the coding unit may not be binary-partitioned and/or ternary-partitioned. Accordingly, the multi-type tree partition indication information may not be signaled but may be deduced from a second value.

Alternatively, only when both of the vertical direction binary tree partitioning and the horizontal direction binary tree partitioning or both of the vertical direction ternary tree partitioning and the horizontal direction ternary tree partitioning are possible for a coding unit corresponding to a node of a multi-type tree, the partition direction information may be signaled. Otherwise, the partition direction information may not be signaled but may be derived from a value indicating possible partitioning directions.

Alternatively, only when both of the vertical direction binary tree partitioning and the vertical direction ternary tree partitioning or both of the horizontal direction binary tree partitioning and the horizontal direction ternary tree partitioning are possible for a coding tree corresponding to a node of a multi-type tree, the partition tree information may be signaled. Otherwise, the partition tree information may not be signaled but be deduced from a value indicating a possible partitioning tree structure.

FIG. 4 is a view showing an intra-prediction process.

Arrows from center to outside in FIG. 4 may represent prediction directions of intra prediction modes.

Intra encoding and/or decoding may be performed by using a reference sample of a neighbor block of the current block. A neighbor block may be a reconstructed neighbor block. For example, intra encoding and/or decoding may be performed by using a coding parameter or a value of a reference sample included in a reconstructed neighbor block.

A prediction block may mean a block generated by performing intra prediction. A prediction block may correspond to at least one among CU, PU and TU. A unit of a prediction block may have a size of one among CU, PU and TU. A prediction block may be a square block having a size of 2×2, 4×4, 16×16, 32×32 or 64×64 etc. or may be a rectangular block having a size of 2×8, 4×8, 2×16, 4×16 and 8×16 etc.

Intra prediction may be performed according to intra prediction mode for the current block. The number of intra prediction modes which the current block may have may be a fixed value and may be a value determined differently according to an attribute of a prediction block. For example, an attribute of a prediction block may comprise a size of a prediction block and a shape of a prediction block, etc.

The number of intra-prediction modes may be fixed to N regardless of a block size. Or, the number of intra prediction modes may be 3, 5, 9, 17, 34, 35, 36, 65, or 67 etc. Alternatively, the number of intra-prediction modes may vary according to a block size or a color component type or both. For example, the number of intra prediction modes may vary according to whether the color component is a luma signal or a chroma signal. For example, as a block size becomes large, a number of intra-prediction modes may increase. Alternatively, a number of intra-prediction modes of a luma component block may be larger than a number of intra-prediction modes of a chroma component block.

An intra-prediction mode may be a non-angular mode or an angular mode. The non-angular mode may be a DC mode or a planar mode, and the angular mode may be a prediction mode having a specific direction or angle. The intra-prediction mode may be expressed by at least one of a mode number, a mode value, a mode numeral, a mode angle, and mode direction. A number of intra-prediction modes may be M, which is larger than 1, including the non-angular and the angular mode. In order to intra-predict a current block, a step of determining whether or not samples included in a reconstructed neighbor block may be used as reference samples of the current block may be performed. When a sample that is not usable as a reference sample of the current block is present, a value obtained by duplicating or performing interpolation on at least one sample value among samples included in the reconstructed neighbor block or both may be used to replace with a non-usable sample value of a sample, thus the replaced sample value is used as a reference sample of the current block.

FIG. 7 is a diagram illustrating reference samples capable of being used for intra prediction.

As shown in FIG. 7 , at least one of the reference sample line 0 to the reference sample line 3 may be used for intra prediction of the current block. In FIG. 7 , the samples of a segment A and a segment F may be padded with the samples closest to a segment B and a segment E, respectively, instead of retrieving from the reconstructed neighboring block. Index information indicating the reference sample line to be used for intra prediction of the current block may be signaled. When the upper boundary of the current block is the boundary of the CTU, only the reference sample line 0 may be available. Therefore, in this case, the index information may not be signaled. When a reference sample line other than the reference sample line 0 is used, filtering for a prediction block, which will be described later, may not be performed.

When intra-predicting, a filter may be applied to at least one of a reference sample and a prediction sample based on an intra-prediction mode and a current block size.

In case of a planar mode, when generating a prediction block of a current block, according to a position of a prediction target sample within a prediction block, a sample value of the prediction target sample may be generated by using a weighted sum of an upper and left side reference sample of a current sample, and a right upper side and left lower side reference sample of the current block. In addition, in case of a DC mode, when generating a prediction block of a current block, an average value of upper side and left side reference samples of the current block may be used. In addition, in case of an angular mode, a prediction block may be generated by using an upper side, a left side, a right upper side, and/or a left lower side reference sample of the current block. In order to generate a prediction sample value, interpolation of a real number unit may be performed.

In the case of intra prediction between color components, a prediction block for the current block of the second color component may be generated on the basis of the corresponding reconstructed block of the first color component. For example, the first color component may be a luma component, and the second color component may be a chroma component. For intra prediction between color components, the parameters of the linear model between the first color component and the second color component may be derived on the basis of the template. The template may include upper and/or left neighboring samples of the current block and upper and/or left neighboring samples of the reconstructed block of the first color component corresponding thereto. For example, the parameters of the linear model may be derived using a sample value of a first color component having a maximum value among samples in a template and a sample value of a second color component corresponding thereto, and a sample value of a first color component having a minimum value among samples in the template and a sample value of a second color component corresponding thereto. When the parameters of the linear model are derived, a corresponding reconstructed block may be applied to the linear model to generate a prediction block for the current block. According to a video format, subsampling may be performed on the neighboring samples of the reconstructed block of the first color component and the corresponding reconstructed block. For example, when one sample of the second color component corresponds to four samples of the first color component, four samples of the first color component may be sub-sampled to compute one corresponding sample. In this case, the parameter derivation of the linear model and intra prediction between color components may be performed on the basis of the corresponding sub-sampled samples. Whether or not to perform intra prediction between color components and/or the range of the template may be signaled as the intra prediction mode.

The current block may be partitioned into two or four sub-blocks in the horizontal or vertical direction. The partitioned sub-blocks may be sequentially reconstructed. That is, the intra prediction may be performed on the sub-block to generate the sub-prediction block. In addition, dequantization and/or inverse transform may be performed on the sub-blocks to generate sub-residual blocks. A reconstructed sub-block may be generated by adding the sub-prediction block to the sub-residual block. The reconstructed sub-block may be used as a reference sample for intra prediction of the sub-sub-blocks. The sub-block may be a block including a predetermined number (for example, 16) or more samples. Accordingly, for example, when the current block is an 8×4 block or a 4×8 block, the current block may be partitioned into two sub-blocks. Also, when the current block is a 4×4 block, the current block may not be partitioned into sub-blocks. When the current block has other sizes, the current block may be partitioned into four sub-blocks. Information on whether or not to perform the intra prediction based on the sub-blocks and/or the partitioning direction (horizontal or vertical) may be signaled. The intra prediction based on the sub-blocks may be limited to be performed only when reference sample line 0 is used. When the intra prediction based on the sub-block is performed, filtering for the prediction block, which will be described later, may not be performed.

The final prediction block may be generated by performing filtering on the prediction block that is intra-predicted. The filtering may be performed by applying predetermined weights to the filtering target sample, the left reference sample, the upper reference sample, and/or the upper left reference sample. The weight and/or the reference sample (range, position, etc.) used for the filtering may be determined on the basis of at least one of a block size, an intra prediction mode, and a position of the filtering target sample in the prediction block. The filtering may be performed only in the case of a predetermined intra prediction mode (e.g., DC, planar, vertical, horizontal, diagonal, and/or adjacent diagonal modes). The adjacent diagonal mode may be a mode in which k is added to or subtracted from the diagonal mode. For example, k may be a positive integer of 8 or less.

An intra-prediction mode of a current block may be entropy encoded/decoded by predicting an intra-prediction mode of a block present adjacent to the current block. When intra-prediction modes of the current block and the neighbor block are identical, information that the intra-prediction modes of the current block and the neighbor block are identical may be signaled by using predetermined flag information. In addition, indicator information of an intra-prediction mode that is identical to the intra-prediction mode of the current block among intra-prediction modes of a plurality of neighbor blocks may be signaled. When intra-prediction modes of the current block and the neighbor block are different, intra-prediction mode information of the current block may be entropy encoded/decoded by performing entropy encoding/decoding based on the intra-prediction mode of the neighbor block.

FIG. 5 is a diagram illustrating an embodiment of an inter-picture prediction process.

In FIG. 5 , a rectangle may represent a picture. In FIG. 5 , an arrow represents a prediction direction. Pictures may be categorized into intra pictures (I pictures), predictive pictures (P pictures), and Bi-predictive pictures (B pictures) according to the encoding type thereof.

The I picture may be encoded through intra-prediction without requiring inter-picture prediction. The P picture may be encoded through inter-picture prediction by using a reference picture that is present in one direction (i.e., forward direction or backward direction) with respect to a current block. The B picture may be encoded through inter-picture prediction by using reference pictures that are preset in two directions (i.e., forward direction and backward direction) with respect to a current block. When the inter-picture prediction is used, the encoder may perform inter-picture prediction or motion compensation and the decoder may perform the corresponding motion compensation.

Hereinbelow, an embodiment of the inter-picture prediction will be described in detail.

The inter-picture prediction or motion compensation may be performed using a reference picture and motion information.

Motion information of a current block may be derived during inter-picture prediction by each of the encoding apparatus 100 and the decoding apparatus 200. The motion information of the current block may be derived by using motion information of a reconstructed neighboring block, motion information of a collocated block (also referred to as a col block or a co-located block), and/or a block adjacent to the co-located block. The co-located block may mean a block that is located spatially at the same position as the current block, within a previously reconstructed collocated picture (also referred to as a col picture or a co-located picture). The co-located picture may be one picture among one or more reference pictures included in a reference picture list.

The derivation method of the motion information may be different depending on the prediction mode of the current block. For example, a prediction mode applied for inter prediction includes an AMVP mode, a merge mode, a skip mode, a merge mode with a motion vector difference, a subblock merge mode, a triangle partition mode, an inter-intra combination prediction mode, affine mode, and the like. Herein, the merge mode may be referred to as a motion merge mode.

For example, when the AMVP is used as the prediction mode, at least one of motion vectors of the reconstructed neighboring blocks, motion vectors of the co-located blocks, motion vectors of blocks adjacent to the co-located blocks, and a (0, 0) motion vector may be determined as motion vector candidates for the current block, and a motion vector candidate list is generated by using the emotion vector candidates. The motion vector candidate of the current block can be derived by using the generated motion vector candidate list. The motion information of the current block may be determined based on the derived motion vector candidate. The motion vectors of the collocated blocks or the motion vectors of the blocks adjacent to the collocated blocks may be referred to as temporal motion vector candidates, and the motion vectors of the reconstructed neighboring blocks may be referred to as spatial motion vector candidates.

The encoding apparatus 100 may calculate a motion vector difference (MVD) between the motion vector of the current block and the motion vector candidate and may perform entropy encoding on the motion vector difference (MVD). In addition, the encoding apparatus 100 may perform entropy encoding on a motion vector candidate index and generate a bitstream. The motion vector candidate index may indicate an optimum motion vector candidate among the motion vector candidates included in the motion vector candidate list. The decoding apparatus may perform entropy decoding on the motion vector candidate index included in the bitstream and may select a motion vector candidate of a decoding target block from among the motion vector candidates included in the motion vector candidate list by using the entropy-decoded motion vector candidate index. In addition, the decoding apparatus 200 may add the entropy-decoded MVD and the motion vector candidate extracted through the entropy decoding, thereby deriving the motion vector of the decoding target block.

Meanwhile, the coding apparatus 100 may perform entropy-coding on resolution information of the calculated MVD. The decoding apparatus 200 may adjust the resolution of the entropy-decoded MVD using the MVD resolution information.

Meanwhile, the coding apparatus 100 calculates a motion vector difference (MVD) between a motion vector and a motion vector candidate in the current block on the basis of an affine model, and performs entropy-coding on the MVD. The decoding apparatus 200 derives a motion vector on a per sub-block basis by deriving an affine control motion vector of a decoding target block through the sum of the entropy-decoded MVD and an affine control motion vector candidate.

The bitstream may include a reference picture index indicating a reference picture. The reference picture index may be entropy-encoded by the encoding apparatus 100 and then signaled as a bitstream to the decoding apparatus 200. The decoding apparatus 200 may generate a prediction block of the decoding target block based on the derived motion vector and the reference picture index information.

Another example of the method of deriving the motion information of the current may be the merge mode. The merge mode may mean a method of merging motion of a plurality of blocks. The merge mode may mean a mode of deriving the motion information of the current block from the motion information of the neighboring blocks. When the merge mode is applied, the merge candidate list may be generated using the motion information of the reconstructed neighboring blocks and/or the motion information of the collocated blocks. The motion information may include at least one of a motion vector, a reference picture index, and an inter-picture prediction indicator. The prediction indicator may indicate one-direction prediction (L0 prediction or L1 prediction) or two-direction predictions (L0 prediction and L1 prediction).

The merge candidate list may be a list of motion information stored. The motion information included in the merge candidate list may be at least one of motion information (spatial merge candidate) of a neighboring block adjacent to the current block, motion information (temporal merge candidate) of the collocated block of the current block in the reference picture, new motion information generated by a combination of the motion information exiting in the merge candidate list, motion information (history-based merge candidate) of the block that is encoded/decoded before the current block, and zero merge candidate.

The encoding apparatus 100 may generate a bitstream by performing entropy encoding on at least one of a merge flag and a merge index and may signal the bitstream to the decoding apparatus 200. The merge flag may be information indicating whether or not to perform the merge mode for each block, and the merge index may be information indicating that which neighboring block, among the neighboring blocks of the current block, is a merge target block. For example, the neighboring blocks of the current block may include a left neighboring block on the left side of the current block, an upper neighboring block disposed above the current block, and a temporal neighboring block temporally adjacent to the current block.

Meanwhile, the coding apparatus 100 performs entropy-coding on the correction information for correcting the motion vector among the motion information of the merge candidate and signals the same to the decoding apparatus 200. The decoding apparatus 200 can correct the motion vector of the merge candidate selected by the merge index on the basis of the correction information. Here, the correction information may include at least one of information on whether or not to perform the correction, correction direction information, and correction size information. As described above, the prediction mode that corrects the motion vector of the merge candidate on the basis of the signaled correction information may be referred to as a merge mode having the motion vector difference.

The skip mode may be a mode in which the motion information of the neighboring block is applied to the current block as it is. When the skip mode is applied, the encoding apparatus 100 may perform entropy encoding on information of the fact that the motion information of which block is to be used as the motion information of the current block to generate a bit stream, and may signal the bitstream to the decoding apparatus 200. The encoding apparatus 100 may not signal a syntax element regarding at least any one of the motion vector difference information, the encoding block flag, and the transform coefficient level to the decoding apparatus 200.

The subblock merge mode may mean a mode that derives the motion information in units of sub-blocks of a coding block (CU). When the subblock merge mode is applied, a subblock merge candidate list may be generated using motion information (sub-block based temporal merge candidate) of the sub-block collocated to the current sub-block in the reference image and/or an affine control point motion vector merge candidate.

The triangle partition mode may mean a mode that derives motion information by partitioning the current block into diagonal directions, derives each prediction sample using each of the derived motion information, and derives the prediction sample of the current block by weighting each of the derived prediction samples.

The inter-intra combined prediction mode may mean a mode that derives a prediction sample of the current block by weighting a prediction sample generated by inter prediction and a prediction sample generated by intra prediction.

The decoding apparatus 200 may correct the derived motion information by itself. The decoding apparatus 200 may search the predetermined region on the basis of the reference block indicated by the derived motion information and derive the motion information having the minimum SAD as the corrected motion information.

The decoding apparatus 200 may compensate a prediction sample derived via inter prediction using an optical flow.

FIG. 6 is a diagram illustrating a transform and quantization process.

As illustrated in FIG. 6 , a transform and/or quantization process is performed on a residual signal to generate a quantized level signal. The residual signal is a difference between an original block and a prediction block (i.e., an intra prediction block or an inter prediction block). The prediction block is a block generated through intra prediction or inter prediction. The transform may be a primary transform, a secondary transform, or both. The primary transform of the residual signal results in transform coefficients, and the secondary transform of the transform coefficients results in secondary transform coefficients.

At least one scheme selected from among various transform schemes which are preliminarily defined is used to perform the primary transform. For example, examples of the predefined transform schemes include discrete cosine transform (DCT), discrete sine transform (DST), and Karhunen-Loeve transform (KLT). The transform coefficients generated through the primary transform may undergo the secondary transform. The transform schemes used for the primary transform and/or the secondary transform may be determined according to coding parameters of the current block and/or neighboring blocks of the current block. Alternatively, transform information indicating the transform scheme may be signaled. The DCT-based transform may include, for example, DCT-2, DCT-8, and the like. The DST-based transform may include, for example, DST-7.

A quantized-level signal (quantization coefficients) may be generated by performing quantization on the residual signal or a result of performing the primary transform and/or the secondary transform. The quantized level signal may be scanned according to at least one of a diagonal up-right scan, a vertical scan, and a horizontal scan, depending on an intra prediction mode of a block or a block size/shape. For example, as the coefficients are scanned in a diagonal up-right scan, the coefficients in a block form change into a one-dimensional vector form. Aside from the diagonal up-right scan, the horizontal scan of horizontally scanning a two-dimensional block form of coefficients or the vertical scan of vertically scanning a two-dimensional block form of coefficients may be used depending on the intra prediction mode and/or the size of a transform block. The scanned quantized-level coefficients may be entropy-encoded to be inserted into a bitstream.

A decoder entropy-decodes the bitstream to obtain the quantized-level coefficients. The quantized-level coefficients may be arranged in a two-dimensional block form through inverse scanning. For the inverse scanning, at least one of a diagonal up-right scan, a vertical scan, and a horizontal scan may be used.

The quantized-level coefficients may then be dequantized, then be secondary-inverse-transformed as necessary, and finally be primary-inverse-transformed as necessary to generate a reconstructed residual signal.

Inverse mapping in a dynamic range may be performed for a luma component reconstructed through intra prediction or inter prediction before in-loop filtering. The dynamic range may be divided into 16 equal pieces and the mapping function for each piece may be signaled. The mapping function may be signaled at a slice level or a tile group level. An inverse mapping function for performing the inverse mapping may be derived on the basis of the mapping function. In-loop filtering, reference picture storage, and motion compensation are performed in an inverse mapped region, and a prediction block generated through inter prediction is converted into a mapped region via mapping using the mapping function, and then used for generating the reconstructed block. However, since the intra prediction is performed in the mapped region, the prediction block generated via the intra prediction may be used for generating the reconstructed block without mapping/inverse mapping.

When the current block is a residual block of a chroma component, the residual block may be converted into an inverse mapped region by performing scaling on the chroma component of the mapped region. The availability of the scaling may be signaled at the slice level or the tile group level. The scaling may be applied only when the mapping for the luma component is available and the division of the luma component and the division of the chroma component follow the same tree structure. The scaling may be performed on the basis of an average of sample values of a luma prediction block corresponding to the color difference block. In this case, when the current block uses inter prediction, the luma prediction block may mean a mapped luma prediction block. A value necessary for the scaling may be derived by referring to a lookup table using an index of a piece to which an average of sample values of a luma prediction block belongs. Finally, by scaling the residual block using the derived value, the residual block may be switched to the inverse mapped region. Then, chroma component block restoration, intra prediction, inter prediction, in-loop filtering, and reference picture storage may be performed in the inverse mapped area.

Information indicating whether the mapping/inverse mapping of the luma component and chroma component is available may be signaled through a set of sequence parameters.

The prediction block of the current block may be generated on the basis of a block vector indicating a displacement between the current block and the reference block in the current picture. In this way, a prediction mode for generating a prediction block with reference to the current picture is referred to as an intra block copy (IBC) mode. The IBC mode may be applied to M×N (M<=64, N<=64) coding units. The IBC mode may include a skip mode, a merge mode, an AMVP mode, and the like. In the case of a skip mode or a merge mode, a merge candidate list is constructed, and the merge index is signaled so that one merge candidate may be specified. The block vector of the specified merge candidate may be used as a block vector of the current block. The merge candidate list may include at least one of a spatial candidate, a history-based candidate, a candidate based on an average of two candidates, and a zero-merge candidate. In the case of an AMVP mode, the difference block vector may be signaled. In addition, the prediction block vector may be derived from the left neighboring block and the upper neighboring block of the current block. The index on which neighboring block to use may be signaled. The prediction block in the IBC mode is included in the current CTU or the left CTU and limited to a block in the already reconstructed area. For example, a value of the block vector may be limited such that the prediction block of the current block is positioned in an area of three 64×64 blocks preceding the 64×64 block to which the current block belongs in the coding/decoding order. By limiting the value of the block vector in this way, memory consumption and device complexity according to the IBC mode implementation may be reduced.

In a general entropy encoder or decoder, a probability value used in encoding or decoding of binary symbols (bin) may be dependent on a previously encoded or decoded binary value and probability value. Therefore, in order to perform encoding or decoding of the current bin, there is a problem that entropy encoding or decoding of the previous bin and a context update need to be completed. Because of this problem, throughput may increase in general entropy coding. In this specification, the throughput may refer to the number of bins to be encoded or decoded per unit time.

In the present invention, in order to solve this problem, dependency on the probability value used in entropy encoding or decoding of the previous bin and the current bin on a per-any-block basis may be removed, or the same syntax elements may be grouped. As a result of the removal of the dependency and the grouping, the throughput of the encoder or the decoder may be enhanced. Further, according to the present invention, one or more probability values may be updated simultaneously using pieces of previous binary information and a probability distribution model, and thus throughput of the encoder or the decoder may be enhanced.

Hereinafter, according to an embodiment of the present invention, a method of encoding or decoding an image by using entropy coding will be described in detail. Herein, the entropy coding may refer to entropy encoding in terms of an encoder and may refer to entropy decoding in terms of a decoder.

FIG. 8 is a diagram illustrating an entropy decoder according to an embodiment of the present invention.

According to FIG. 8 , a bitstream may be input to an entropy decoding module and a context update module. Herein, the entropy decoding module may refer to an arithmetic entropy decoding module or a binary arithmetic entropy decoding module. Further, in an embodiment of the present invention, entropy encoding/decoding may refer to arithmetic entropy encoding/decoding.

The entropy decoding module and the context update module may perform entropy decoding and the context update using a context corresponding to a syntax element to be currently decoded. In this specification, the context may refer to occurrence probability information for each bin or a binary value of an already encoded or decoded syntax element. The context update module may perform the context update to apply the currently decoded probability information to entropy decoding of the immediately subsequent bin, and may store the updated context in a context memory. Herein, the context corresponding to the syntax element to be currently decoded may be derived by a context modeler. Further, the context corresponding to the bin within the syntax element to be currently decoded may be derived by the context modeler. For example, the context modeler may consist of a context selection module and a context memory. The context corresponding to the current bin selected by the context selection module may be loaded from the context memory to be used for entropy decoding. After entropy decoding is performed, a debinarization module may perform a debinarization process in which at least one of binary values is transformed into a syntax element form. The debinarization module may perform debinarization on at least one of the input binary values and may output syntax element information. Herein, at the same time as the debinarization process, the current syntax element and binary information may be transmitted to the context modeler, and may be used to select the context for the subsequent bin to be decoded.

In the decoder according to FIG. 8 , the probability information used in decoding of the current bin is dependent on the previously decoded binary value. Therefore, only after entropy decoding for the previous bin and the probability update are completed, entropy decoding of the current bin starts. This may cause a problem of increase in throughput.

FIG. 9 is a diagram illustrating an entropy decoder according to another embodiment of the present invention.

The decoder according to the present invention may not perform the context update within any predefined unit (hereinafter, referred to as an entropy coding unit (ECU)) in order to enhance throughput by removing probability dependency on the previous bin and the current bin. That is, the entropy decoder may perform the context update of the syntax element on a per-ECU basis.

For example, in this specification, the ECU may refer to any block having an N×M size. Herein, N and M may be positive integers.

As another example, the ECU may be at least one among a picture, a CTU, a subpicture, a tile, a brick, a slice, a CU, a PU, a TU, a CTB, a CB, a PB, and a TB. As still another example, the ECU may refer to a subblock constituting at least one among a picture, a CTU, a subpicture, a tile, a brick, a slice, a CU, a PU, a TU, a CTB, a CB, a PB, and a TB. Herein, the subblock may refer to a basic unit in which independent transform coefficient scanning is performed in the entropy encoding or decoding process.

As still another example, the ECU may refer to a unit including a predefined number of bins. Herein, the predefined number of bins may be a positive number N other than 0. That is, the ECU may be changed on the basis of N bins. Herein, the number N of bins may refer to the number of context bins in which the context update is performed except for bypass bins in which the context update is not performed. For example, N may be a fixed value that is transmitted through at least one among a sequence, a picture, a tile, a slice (segment) header, and a parameter set, or that is used in the encoder and the decoder. As still another example, N may be determined on the basis of at least one of coding parameters transmitted from the encoder to the decoder. As still another example, N may be determined on the basis of at least one of coding parameters of the current block. For example, N may be determined on the basis of at least one among the size, the depth, the shape, the prediction mode, and the transform mode of the current block including the current bin. Herein, the size of the block may include at least one among the horizontal size of the block and the vertical size of the block.

For example, the decoder in FIG. 9 may be an example of the improvement of the decoder in FIG. 8 . Compared to the entropy decoder in FIG. 8 , the entropy decoder in FIG. 9 may not include the context update module.

According to FIG. 9 , the entropy decoding module may load the context for the current bin from the context memory and may perform entropy decoding, without the context update. Herein, the update on the context may not be performed within the ECU. According to the present invention, waiting for the context update for the previous bin or a memory access operation for loading the context is not performed, so that throughput of entropy decoding may be enhanced.

FIGS. 10A-10B are diagrams illustrating an entropy encoding method and an entropy decoding method according to an embodiment of the present invention.

The entropy encoding method according to the embodiment of the present invention may include generating a bin for a syntax element of a current block by binarizing the syntax element at step S1010 a, updating a context used in entropy encoding of the syntax element of the current block at step S1020 a, and generating a bitstream for the syntax element of the current block by using the generated bin and the updated context at step S1030 a. Herein, the context update may be performed on a per-ECU basis. Further, when the syntax element of the current block is already binarized, the step of generating of the bin for the syntax element is omitted, and the bin in the binarized syntax element is subjected to entropy encoding and then generated as a bitstream. Further, the bitstream for the syntax element of the current block may be generated using only the bin. For example, according to the type or value of the syntax element of the current block, whether to perform binarization may be determined.

The entropy decoding method according to the embodiment of the present invention may include updating a context used in entropy decoding of a syntax element of a current block at step S1010 b, generating a bin for the syntax element of the current block by entropy decoding a bitstream on the basis of the updated context at step S1020 b, and obtaining the syntax element of the current block by debinarizing the generated bin at step S1030 b. Herein, the context update may be performed on a per-ECU basis. Further, when the syntax element of the current block is already binarized, the process of debinarization is omitted, and the syntax element of the current block is obtained using at least one of the generated bins. For example, according to the type or value of the syntax element of the current block, whether to perform debinarization may be determined.

The syntax element may include at least one bin.

FIGS. 11A-11B are diagrams illustrating an entropy encoding method and an entropy decoding method according to another embodiment of the present invention.

The entropy encoding method according to the embodiment of the present invention may include determining whether to perform a context update for a first syntax element of a current block at step S1110 a, updating a context for entropy encoding of the first syntax element on the basis of the determination at step S1120 a, and generating a bitstream for the current block by using the updated context and the generated bin at step S1130 a. Further, the bitstream for the syntax element of the current block may be generated using only the bin.

Herein, whether to perform the context update may be determined on the basis of the number of pre-encoded predetermined syntax elements or bins for the current block.

The entropy decoding method according to the embodiment of the present invention may include determining whether to perform a context update for a first syntax element of a current block at step S1110 b, updating a context for entropy decoding of the first syntax element on the basis of the determination at step S1120 b, and generating a bin for the first syntax element on the basis of the updated context at step S1130 b. Further, the bin for the first syntax element may be generated without using the updated context.

Herein, whether to perform the context update may be determined on the basis of the number of pre-decoded predetermined syntax elements or bins for the current block.

FIG. 12 is another diagram illustrating an entropy encoding method according to an embodiment of the present invention.

The entropy encoding method according to the present invention will be described in detail with reference to FIG. 12 . The encoder according to the present invention may perform the context update on a per-ECU basis. For the first ECU of a picture or tile, the encoder may perform entropy encoding after initializing the context with a predefined probability value.

The embodiment in FIG. 12 may be an embodiment of a case in which it is assumed that an ECU and a CTU are the same in size. Therefore, the encoder may perform the context update on a per-CTU basis. The encoder may determine that entropy encoding of the current CTU is completed, by using a syntax element, such as a syntax element end_of_tile_flag, or the like, for identifying the CTU boundary. That is, when the syntax element end_of_tile_flag, or the like is encoded, the encoder determines that the subsequent syntax element is a syntax element included in the subsequent ECU, performs an update on all contexts, and performs entropy encoding. Herein, during entropy encoding for one ECU, the context may not be additionally updated.

For example, when the size of the ECU is equal to or smaller than the size of the CTU, the encoder calculates the area of the encoded CU and determines ECU boundaries for syntax elements.

For example, in the case where the ECU is a size of 32×32, when encoding of the CU corresponding to a 32×32 area is completed, the encoder determines that the subsequent syntax elements are included in the subsequent ECU.

As another example, when the size of the ECU is defined as the maximum transform size, the encoder calculates the area of an encoded TU and determines the ECU boundaries for syntax elements.

For example, in the case where the ECU is defined as having the maximum transform size 64×64, when encoding of the TU corresponding to a 64×64 area is completed, the encoder determines that the subsequent syntax elements are included in the subsequent ECU.

The above-described area is an example, and the area of the ECU may be defined as N×M. Herein, N and M may be positive integers.

As still another example, in the case where the ECU refers to a subblock that is subjected to independent transform coefficient scanning in the entropy encoding process, when the encoder determines that an index for the subblock is changed during the entropy encoding process for the residual signal-related syntax element included in the subblock, the encoder determines that the ECU is changed.

As still another example, in the case where the ECU refers to a subblock that is subjected to independent transform coefficient scanning in the entropy encoding process, the encoder may determine the ECU boundaries using the number of encoded transform coefficients.

As still another example, in the case where the ECU is a unit including a predefined number of bins, the encoder may encode the preset N bins and then may determine that the ECU is changed.

FIG. 13 is another diagram illustrating an entropy decoding method according to an embodiment of the present invention.

The entropy decoding method according to the present invention will be described in detail with reference to FIG. 13 . The decoder according to the present invention may perform the context update on a per-ECU basis. For the first ECU of the picture of the tile, the decoder may perform entropy decoding after initializing the context with a predefined probability value.

The embodiment in FIG. 13 may be an embodiment of a case in which it is assumed that an ECU and a CTU are the same in size. Therefore, the decoder may perform the context update on a per-CTU basis. The decoder may determine that entropy decoding of the current CTU is completed, by using a syntax element, such as a syntax element end_of_tile_flag, or the like, for identifying the CTU boundary. That is, when the syntax element end_of_tile_flag, or the like is decoded, the decoder determines that the subsequent syntax element is a syntax element included in the subsequent ECU, performs an update on all contexts, and performs entropy decoding. Herein, during entropy decoding for one ECU, the context may not be additionally updated.

For example, when the size of the ECU is equal to or smaller than the size of the CTU, the decoder calculates the area of the decoded CU and determines the ECU boundary for syntax elements.

For example, in the case were the ECU is a size of 32×32, when decoding of the CU corresponding to an 32×32 area is completed, the decoder determines that the subsequent syntax elements are included in the subsequent ECU.

As another example, when the size of the ECU is defined as the maximum transform size, the decoder calculates the area of a decoded TU and determines the ECU boundary for syntax elements.

For example, in the case where the ECU is defined as having the maximum transform size 64×64, when decoding of the TU corresponding to a 64×64 area is completed, the decoder determines that the subsequent syntax elements are included in the subsequent ECU.

The above-described area is an example, and the area of the ECU may be defined as N×M. Herein, N and M may be positive integers.

As still another example, in the case where the ECU refers to a subblock that is subjected to independent transform coefficient scanning in the entropy decoding process, when the decoder determines that an index for the subblock is changed during the entropy decoding process for the residual signal-related syntax element included in the subblock, the decoder determines that the ECU is changed.

As still another example, in the case where the ECU refers to a subblock that is subjected to independent transform coefficient scanning in the entropy decoding process, the decoder may determine the ECU boundary using the number of decoded transform coefficient.

For example, in the case where the size of the subblock is predefined as 4×4, 2×8, 8×2, or the like, when decoding of 16 transform coefficient-related syntax elements is completed in the scanning order, the decoder determines that the subsequent residual signal-related syntax elements are included in the subsequent subblock (namely, the ECU). Herein, the number of transform coefficients may be calculated from residual signal-related syntax elements that are explicitly transmitted as well as syntax elements for a residual signal which may be implicitly derived from at least one syntax element of syntax elements last_sig_coeff_x_prefix, last_sig_coeff_y_prefix, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, abs_level_gtx_flag, abs_remainder, dec_abs_level, coeff_sign_flag, and the like.

Herein, at least one among last_sig_coeff_x_prefix, last_sig_coeff_y_prefix, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, abs_level_gtx_flag, abs_remainder, dec_abs_level, and coeff_sign_flag may refer to a syntax element used to entropy encode/decode the residual signal of the current block.

As still another example, in the case where the ECU is a unit including a predefined number of bins, the decoder may decode the preset N bins and then may determine that the ECU is changed.

According to another embodiment of the present invention, the encoder or the decoder may perform the context update only for the bins included in the ECU and may not perform the context update for the bins not included in the ECU.

For example, in the case where the ECU is a unit including a predefined number of syntax elements or bins, the encoder or decoder may perform the context update only for the predefined number of bins during syntax element encoding or decoding on the current block and may not perform the context update for the bins exceeding the predefined number.

For example, when the encoder or decoder entropy encodes or decodes at least one of any syntax elements for the current block, the encoder or decoder performs the context update only for at least one of the predefined number of the syntax elements and does not perform the context update for at least one of the remaining syntax elements.

Herein, the bin subjected to the context update may be referred to as a context bin, and a process of encoding/decoding the context bin may be referred to as context coding. Further, the bin not subjected to the context update may be referred to as a bypass bin, and a process of encoding/decoding the bypass bin may be referred to as bypass coding.

As another example, the encoder or decoder may calculate the number of times that at least one of the predetermined syntax elements in the current block is encoded or decoded (parsed), in order to determine whether to perform the context update for the first syntax element of the current block. For example, when the number of times that at least one of the predetermined syntax elements in the current block is encoded or decoded exceeds a predefined value, the encoder or decoder does not perform the context update for the first syntax element. However, when the number of times that at least one of the predetermined syntax elements in the current block is parsed is equal to or less than the predefined value, the encoder or decoder performs the context update for the first syntax element.

In order to calculate the number of times that the first syntax element is parsed, the encoder or decoder may set a variable for calculating the number of times that at least one of the predetermined syntax elements is encoded or decoded. Herein, an initial value of the variable for calculating the number of times that the at least one of the predetermined syntax elements is encoded or decoded may be determined by the number N of bins predefined by the ECU. As another example, an initial value of the variable for calculating the number of times that the at least one of the predetermined syntax elements is encoded or decoded may be determined on the basis of a coding parameter of the current block. For example, the initial value of the variable for calculating the number of times that the syntax element is parsed may be determined on the basis of at least one among the size, the depth, and the shape of the current block. Herein, the size of the block may include at least one among the horizontal size of the block and the vertical size of the block.

Each time at least one of the predetermined syntax elements is encoded or decoded, the encoder or decoder reduces the value of the variable for calculating the number of times that the syntax element is encoded or decoded, and thus determines the number of encoded or decoded syntax elements. That is, when the variable becomes equal or less than a particular value, the encoder or decoder determines that the predefined number of the syntax elements are encoded or decoded. When a predefined number of context updates are performed for at least one of predetermined syntax elements, the encoder or decoder performs entropy encoding or decoding on the first syntax element to be encoded or decoded later without the context update.

For example, at least one of predetermined syntax elements may be a syntax element accompanied by the context update. That is, even though encoding or decoding is performed for any syntax element, when the syntax element is a syntax element that is not accompanied by the context update, encoding or decoding of the syntax element is not included in the above-described number of times that encoding or decoding is performed. That is, when any syntax element is the syntax element that is not accompanied by the context update, the encoder or decoder does not reduce the variable for calculating the number of times that the predetermined syntax element is encoded or decoded.

For example, the syntax element that is not accompanied by the context update may be coded_sub_block_flag, abs_remainder, or the like.

For example, in the present invention, the first syntax element may be coeff_sign_flag. Further, the predetermined syntax element may be at least one among coeff_sign_flag, sig_coeff_flag, abs_level_gtx_flag, and par_level_flag.

Herein, the syntax element coeff_sign_flag may indicate a sign of a level of a transform coefficient. The syntax element sig_coeff_flag may indicate whether a quantized level at a particular position is 0. The syntax element abs_level_gtx_flag may be related to an absolute value of a quantized level at a particular position. The syntax element par_level_flag may indicate parity of a quantized level at a particular position.

Further, the syntax element coded_sub_block_flag may indicate whether a quantization level encoded on a per-subblock basis is present. The syntax element abs_remainder may be related to a residual size value of an absolute value of a quantized level.

As still another example, the above embodiment in which whether to perform the context update for the syntax element to be encoded or decoded is determined may be performed only when the current block is encoded or decoded in a transform skip mode. That is, when the current block is not in the transform skip mode, the encoder or decoder does not perform the context update for the syntax element to be encoded or decoded.

Hereinafter, the above-described binarization or debinarization step will be described in detail.

The encoder may perform a binarization process in which syntax elements to be encoded are transformed into a binary string, before performing entropy encoding. The binarized binary string may be used for the context update and entropy encoding in order, starting from the first binary value transformed.

Regarding binarization for each of the syntax elements, at least one among an optimum method considering the probability of occurrence of each value within a range of values that each of the syntax elements may have, and a fixed method predefined by the encoder may be used. For example, at least one of the following methods may be selectively used according to each syntax element: truncated rice binarization, K-th order exponential Golomb binarization, limited K-th order exponential Golomb binarization, fixed-length binarization, unary binarization, and truncated unary or truncated binary binarization methods.

For example, when the probability distribution of values of the MVD syntax element, which represents the absolute value of the difference of motion vectors, is similar to Laplacian probability distribution, the encoder performs binarization using unary binarization.

As another example, the encoder may change the binarization method using statistical information of the syntax element previously encoded for each syntax element.

For example, from the first block to the current block of the slice, tile, or picture, binarization is performed using a predefined 0-th order exponential Golomb binarization method. However, when the probability distribution of the encoded MVD syntax element values indicates probability distribution appropriate to the 1-th order exponential Golomb, the encoder performs binarization for the MVD syntax element by using 1-th order exponential Golomb binarization.

In the meantime, the decoder may perform a debinarization process in which the value of the syntax element is output using a binary string output through entropy decoding. The output binary string may be used for context update and decoding processes.

Regarding debinarization for each of the syntax elements, at least one among an optimum method considering the probability of occurrence of each value within a range of values that each of the syntax elements may have, and a fixed method predefined by the decoder may be used. For example, at least one of the following methods may be selectively used according to each syntax element: truncated rice debinarization, K-th order exponential Golomb debinarization, limited K-th order exponential Golomb debinarization, fixed-length binarization, unary debinarization, and truncated unary or truncated binary debinarization methods.

For example, when the probability distribution of values of the MVD syntax element, which represents the absolute value of the difference of motion vectors, is similar to Laplacian probability distribution, the decoder performs debinarization using unary debinarization.

As another example, the decoder may change the debinarization method using statistical information of the syntax element previously decoded for each syntax element.

For example, from the first block to the current block of the slice, tile, or picture, debinarization is performed using a predefined 0-th order exponential Golomb binarization method. However, when the probability distribution of the decoded MVD syntax element values indicates probability distribution appropriate to the 1-th order exponential Golomb, the decoder performs debinarization for the MVD syntax element by using 1-th order exponential Golomb debinarization.

Hereinafter, the above-described context update step of the encoder or decoder will be described in detail.

According to an embodiment of the present invention, the encoder or decoder may update the context on a per-ECU basis. Herein, the size of the ECU may be determined on the basis of a value transmitted through at least one among a sequence, a picture, a tile, a slice (segment) header, and a parameter set, or may be derived using the size of the CTU, the maximum transform size, the size of at least one among a CU, a PU, a TU, a CB, a PB, and a TB, or the like.

Further, the encoding/decoding order of the ECUs may be the same as the encoding or decoding order of the coding units (CUs) having the same size as the ECUs or of the transform units (TUs) within the CU. When the ECU is defined on a per-subblock basis, the update order of the context is the same as the entropy encoding or decoding order (scanning order) for the subblock.

As another example, the encoding or decoding order of the ECUs may be predefined between the encoder and the decoder, or may be determined according to a value transmitted through at least one among a sequence, a picture, a tile, a slice (segment) header, and a parameter set.

For example, the context may consist of variables that represent the probability of occurrence of 0 or 1 for one bin, and may include a most probable symbol (MPS) or least probable symbol (LPS) binary value, and a probability value (or an index representing the probability) therefor. Among binary strings for respective syntax elements, at least one context may be used for a particular bin and thus entropy encoding efficiency may be enhanced. In this specification, a bin using probability determined on the basis of a context may be defined as a regular bin, and a bin using fixed probability (for example, 0.5) may be defined as a bypass bin. Further, during the encoding or decoding process, when the context is updated by applying a statistical characteristic of the occurring binary value, the encoder or decoder has higher encoding efficiency. Herein, the regular bin and the context bin may have the same meaning.

FIG. 14 is a diagram illustrating a context and a binary string according to an embodiment of the present invention.

The table in FIG. 14 shows an example of a binary string of an x or y absolute value (abs_mvd) syntax element of a motion vector difference and an assigned context. As shown at the bottom of FIG. 14 , contexts may be assigned only for some binary indexes. Contexts may not be assigned for the remaining bins, and entropy encoding or decoding may be performed assuming that the probability of 0 or 1 is 0.5. When a context is assigned for a binary string, each context includes probability information that is updatable on a per-ECU basis. The probability information may be represented as probability of 1 (or probability of 0), probability of the MPS and LPS values (or probability of MPS), or the like. For example, a probability value may be represented in a form in which an index value in the form of an integer value predefined by the encoder or decoder is mapped to each bin.

For example, contexts may be updated using information on bins occurring when encoding or decoding previous ECUs of the current ECU, and the updated contexts may be used when entropy encoding or decoding the current ECU.

Herein, the context assigned to all syntax elements occurring when encoding or decoding at least one previous ECU may be updated. As another example, only contexts assigned to bins included in the residual signal-related syntax element may be updated.

For example, with respect to at least one of residual signal-related syntax elements tu_cbf_luma, tu_cbf_cb, tu_cbf_cr, transform_skip_flag, tu_mts_flag, mts_idx, last_sig_coeff_x_prefix, last_sig_coeff_y_prefix, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, abs_level_gtx_flag, abs_remainder, dec_abs_level, and coeff_sign_flag for N (herein, N>=1) TUs or subblocks occurring during encoding or decoding in the previous ECU, the corresponding contexts may be updated before entropy encoding or decoding is performed on the current ECU.

For example, when a flag (tu_cbf_luma, tu_cbf_cb, or tu_cbf_cr) indicating whether a residual signal to be encoded or decoded for any TU is present is 0, the flags are updated and context updates for the remaining residual signal-related syntax elements (transform_skip_flag, tu_mts_flag, mts_idx, last_sig_coeff_x_prefix, last_sig_coeff_y_prefix, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, abs_level_gtx_flag, abs_remainder, dec_abs_level, coeff_sign_flag, and the like) are omitted.

As another example, only contexts assigned to bins of syntax elements except for syntax elements of a higher concept than the ECU may be updated. For example, a partitioning flag syntax element may be a syntax element that indicates whether a block (the CTU when the ECU is based on the CU or TU) which may be a higher concept than the ECU is partitioned. In this case, the context for binary values in which the context is used in the partitioning flag syntax element may not be updated on a per-ECU basis, but may be updated whenever encoding or decoding occurs. To this end, the encoder and the decoder may predefine which context is always updated.

As still another example, in the case where the ECU is based on a subblock, when a context update for residual signal-related syntax elements included in the subblock is omitted and an index for the subblock is changed, among the residual signal-related syntax elements included in the subblock, before performing encoding or decoding for the first syntax element, a context update is performed on the residual signal-related syntax elements in the subblock. The other syntax elements may be subjected to a context update on a per-bin basis.

For example, regarding syntax elements, among the residual signal-related syntax elements included in the subblock, a context update for at least one of syntax elements transform_skip_flag, tu_mts_flag, mts_idx, last_sig_coeff_x_prefix, last_sig_coeff_y_prefix, last_sig_coeff_x_suffix, last_sig_coeff_y_suffix, coded_sub_block_flag, sig_coeff_flag, par_level_flag, abs_level_gtx_flag, abs_remainder, dec_abs_level, and coeff_sign_flag, which use a regular bin, may be omitted, and the context update for the syntax element may be performed when encoding or decoding of the subsequent subblock starts.

As still another example, in the case where the ECU is a unit including a predefined number of bins, a context update may be performed on the basis of N regular bins.

For example, entropy encoding or decoding may be performed on N bins in the current ECU without a context update. Before performing entropy encoding or decoding on the subsequent ECU, a context update may be performed for syntax elements of the N bins. Further, for example, entropy encoding or decoding may be performed on N regular bins in the current ECU without a context update. Before performing entropy encoding or decoding on the subsequent ECU, a context update may be performed for syntax elements of the N regular bins.

As still another example, for the N regular bins in the current ECU, the context update is performed while entropy encoding or decoding is performed. For regular bins exceeding N regular bins, the context update may not be performed. Herein, the regular bin may refer to a context bin.

According to the embodiment of the present invention, the context update is performed on a per-ECU basis, so that dependency on the context update process and the entropy encoding or decoding process within one ECU may be removed. Therefore, after entropy decoding of all the previous ECUs is completed, the decoder may use the decoded syntax element information and the binary value to update the context to be used for entropy decoding of the current ECU.

Further, by removing the dependency on the context update process and the entropy encoding or decoding process, the encoder or decoder may simultaneously perform entropy encoding or decoding of the current ECU and the context update for the subsequent ECU.

As still another example, according to another embodiment of the present invention, with respect to the bin of the ECU included in the current block, the context update is performed for each bin. With respect to the bins not included in the ECU, entropy encoding or decoding may be performed without the context update.

Hereinafter, a detailed embodiment of the context update step will be described in detail.

For example, for any syntax element, by using the binary value occurring when entropy encoding or decoding at least one previous ECU and the context before the update, the context update may be performed according to the occurrence order. The updated context may be used to perform entropy encoding or decoding of the subsequent ECU.

FIG. 15 is a diagram illustrating a context update method using a look-up table according to an embodiment of the present invention. FIG. 16 is another diagram illustrating a context update method using a look-up table according to an embodiment of the present invention.

FIG. 15 shows utilization in a method of performing a context update on the basis of the occurrence order. The context update according to the embodiment may be performed on the basis of a look-up table. For example, in the case where the total number of contexts is numCtx, where the number of bins occurring in the previous ECU for each context is numDecBin, where the value of each bin is binVal, and where the value of the MPS is valMps, the encoder or decoder may continuously update probability values by referring to probability update tables transIdxLps and transIdxMps according to whether binary value is the LPS or the MPS in the order in which the binary values occur. By using the probability value pStateIdx in which the update is finally completed, the entropy encoding or decoding process of the current ECU may be performed.

FIG. 16 is a diagram illustrating actual probability values for a total of 64 probability indexes of the tables transIdxMps and transIdxLps that store probability index values changed for each case, when the MPS and the LPS have occurred.

For example, the encoder or decoder may store all the binary values for each context which occur in the previous ECU, and then may perform the context update processes for all the bins simultaneously. As another example, the encoder or the decoder may perform the context update immediately after the occurrence of each bin by using the binary value occurring in the entropy encoding or decoding process of the previous ECU and the corresponding context information.

FIG. 17 is a diagram illustrating a context update method using a linear probability update model according to an embodiment of the present invention.

FIG. 17 shows an example of pseudocode that may be utilized in an occurrence order-based context update method using a linear probability update model. In the case where the total number of contexts is numCtx, where the number of decoded bins occurring in the previous ECU for each context is numDecBin, and where the value of each bin is binVal, the encoder or the decoder may continuously update the probability by using a linear probability model according to whether the binary value is the LPS or the MPS in the order in which the binary values occur. By using the probability value pStateIdx in which the update is finally completed, the entropy encoding or decoding process of the current ECU may be performed.

According to the pseudocode in FIG. 17 , the encoder or the decoder may independently perform context updates for all the bins occurring in the previous ECU with respect to each probability model by using two linear probability update models a and b having different update rates, which are capable of deriving the probability index for the probability of 1. The encoder or the decoder may use the average value pStateIdx of the two finally-updated probabilities pOStateIdx and plStateIdx for entropy encoding or decoding of the current ECU.

Further, in the case where a bin less than a threshold value predefined using the number numDecBin of each context occurs, the encoder or the decoder may set the context update rate to be fast. On the other hand, in the case where a bin equal to or greater than the threshold value occurs, the encoder or the decoder may set the context update rate to be slow. Based on this, the encoder or the decoder may adaptively adjust the update rate of the context on a per-ECU basis, thereby enhancing the compression efficiency.

For example, the encoder or decoder may store all the binary values for each context which occur in the previous ECU, and then may perform the context update processes for all the bins simultaneously. As another example, the encoder or the decoder may perform the context update immediately after the occurrence of each bin by using the binary value occurring in the entropy encoding or decoding process of the previous ECU and the corresponding context information.

As another example, for any syntax element, by using the binary value occurring when entropy encoding or decoding at least one previous ECU and the context before the update, the context update may be performed according to the frequency of occurrence of 0 and 1 for each context. By using the updated context, entropy encoding or decoding of the subsequent ECU may be performed. That is, on the basis of the difference in the frequency of the occurrence of 0 and 1 for the context, the context may be updated.

FIG. 18 is a diagram illustrating a context update method using a look-up table according to another embodiment of the present invention.

FIG. 18 shows pseudocode that may be utilized for a method of performing a context update on the basis of the frequency of occurrence. The context update according to the embodiment may be performed on the basis of a look-up table. For example, in the case where the total number of contexts is numCtx, and where the numbers of encoded or decoded bins 0 and 1 in the previous ECU for each context are numDecBin0 and numDecBin1, respectively, the encoder or the decoder may derive the difference difCount in the frequency of occurrence and a binary value binVal with the greater frequency of occurrence of 0 and 1. The encoder or the decoder may perform the context update using the derived difference in frequency and the look-up table and may derive a final probability value pStateIdx. The finally derived probability value may be used for entropy encoding or decoding of the current ECU.

For example, in the case where in encoding or decoding of the previous ECU, 0 using any context occurs 10 times and 1 occurs six times, considering that 0 occurs four more times than 1 occurs, the encoder or the decoder may perform the context update considering the state where 0 occurs four times for the context. The encoder or the decoder may use the updated context for entropy encoding or decoding of the current ECU. That is, the encoder or the decoder may perform the context update on the basis of the difference in the frequency of occurrence. The encoder or the decoder may derive the final probability value on the basis of the updated context for use in the entropy decoding process of the current ECU.

FIG. 19 is a diagram illustrating a context update method using a linear probability update model according to another embodiment of the present invention.

FIG. 19 shows pseudocode that may be utilized for a context update method based on the frequency of occurrence using a linear probability update model. In the case where the total number of contexts is numCtx, and where among the encoded or decoded bins occurring in the previous ECU for each context, the numbers of 0 and 1 are numDecBin0 and numDecBin1, respectively, the encoder or the decoder may derive the difference difCount in the frequency of occurrence and the binary value binVal with the great frequency of occurrence, and may put the results to the linear probability model to derive a probability value pStateIdx with a single calculation. The derived probability value may be used for the entropy encoding or decoding process of the current ECU.

In FIG. 19 , the encoder or the decoder may update the context using two linear probability update models a and b having different update rates, which are capable of deriving the probability index for the probability of 1. Herein, the encoder or the decoder may update the context assuming that only bins with the great frequency in the previous ECU occur. The average value pStateIdx of the two finally-derived probabilities pOStateIdx and plStateIdx may be used for entropy encoding or decoding of the current ECU.

As another example, in the case where a bin less than a threshold value predefined using the frequency of occurrence for each context occurs, the encoder or the decoder may set the context update rate to be fast. On the other hand, in the case where a bin equal to or greater than the threshold value occurs, the encoder or the decoder may set the context update rate to be slow. Herein, the predefined threshold value may be determined using the sum of the frequencies of occurrence (the sum of numDecBin0 and numDecBin1) for each context. Based on this, the encoder or the decoder may adaptively adjust the update rate of the context on a per-ECU basis, thereby enhancing the compression efficiency.

For example, the encoder or the decoder may calculate the difference in frequency of binary values occurring in the previous ECU to perform the context update processes for all the bins simultaneously. As another example, the encoder or the decoder may calculate the difference in frequency of binary values occurring in the entropy encoding or decoding process of the previous ECU, and may perform the context update immediately after the occurrence of each bin.

As still another example, the encoder or the decoder may derive a probability distribution model similar to the probability distribution of bins of at least one previous ECU, and may use the derived probability distribution model to update at least one context for entropy encoding or decoding of the current ECU.

FIG. 20 is a diagram illustrating a context update method using a probability distribution model according to an embodiment of the present invention.

As shown in FIG. 20 , when the probability distribution for abs_mvd of previous ECUs is similar to 0-th order exponential Golomb (EGO), the encoder or the decoder changes the probability value of the context for two or more bins of abs_mvd by using the probability distribution P(x) optimum for the 0-th order exponential Golomb binarization. Herein, the case where the abs_mvd probability distribution of previous ECUs is similar to the 0-th order exponential Golomb (EGO) may refer to a case where it is determined that the probability of occurrence for each of 0 and 1 is similar to the probability distribution P(x)=1/(2(x+1){circumflex over ( )}2) optimum for the 0-th order exponential Golomb binarization. Further, the probability values of the contexts for 0 and 1 may also be changed using the P(x). The encoder or the decoder may perform entropy encoding or decoding for abs_mvd of the current ECU by using the context in which the probability value is changed. That is, the encoder or the decoder may define at least one probability distribution model used in any syntax element, may derive the probability distribution model similar to the probability distribution for the syntax element in the previous ECUs, and may perform, on the basis thereof, the context update.

That is, the encoder or the decoder may update probability values simultaneously using the probability distribution of pieces of pre-encoded or decoded binary information and a predefined probability distribution model, thereby enhancing the throughput.

Hereinafter, the above-described entropy encoding or decoding step will be described in detail.

According to an embodiment of the present invention, entropy encoding or decoding may be performed on all blocks within the current ECU without the context update.

Further, according to another embodiment of the present invention, for the syntax elements of the ECU included in the current block, the context update may be performed for each syntax element and entropy encoding or decoding may be performed. For syntax elements not included in the ECU, entropy encoding or decoding may be performed without performing the context update.

For example, for the syntax elements other than the residual signal-related syntax elements, the context update may be performed within the current ECU.

As another example, for the contexts corresponding to the syntax elements except for the syntax elements of a higher concept than the ECU, the context update may be performed within the current ECU.

The encoder or the decoder may use the binary value occurring in the entropy encoding or decoding process for the current ECU and the context information to update the context to be used for encoding or decoding of the subsequent ECU. That is, the arithmetic entropy encoding or decoding process for the current ECU may be performed simultaneously with the context update process for the subsequent ECU.

FIG. 21 is a diagram illustrating a method in which an entropy encoding or decoding process and a context update process are simultaneously performed according to an embodiment of the present invention.

FIG. 21 shows an example in which a process of updating the context on a per-ECU basis and an arithmetic entropy decoding process are implemented in a pipeline form. As shown in FIG. 21 , the decoder may perform context initialization with a predefined value with respect to the first ECU of the picture, thereby performing entropy decoding. The decoder may perform decoding on pixels within the ECU by using entropy decoded syntax elements. For example, arithmetic entropy decoding and pixel decoding may be performed on the basis of a CU within the ECU. While entropy decoding for the first ECU is performed, the context update for the second ECU may be performed. Similarly, while arithmetic entropy decoding for the second ECU is performed, the context update for the third ECU may be performed. Although the example in FIG. 21 is described only for the decoding process, the present embodiment may be equally applied to the encoding process. That is, the encoding steps for respective ECUs may be simultaneously performed by the encoder.

As encoding or decoding of the current ECU and the subsequent ECU is simultaneously performed step by step, the throughput of the overall entropy decoding process may be increased.

Hereinafter, the above-described context initialization will be described in detail.

The context initialization may be performed when the current ECU is the first ECU of a picture or slice. When the current ECU is the first ECU of a picture, slice, or tile, one or more predefined parameters are used to initialize the context.

For example, by using a function f that may receive, as parameters, a quantization parameter QP for any context, a variation m of a probability according to the quantization parameter, a probability n when the quantization parameter is 0, the initial probability P1 of bin 1 for any context may be derived. Further, the probability of 0 (P0), the MPS, and the LPS may be derived using the probability of the bin 1. For example, the probabilities of bins 0 and 1, the MPS, and the LPS may be derived according to Equation 1 below. P1=f(QP,m,n),P0=1−P1 MPS=(P1>=0.5)?1:0,LPS=!MPS  [Equation 1]

The parameters for deriving an initial context probability may be defined to have different values according to at least one among a slice type, a type of image to be encoded or decoded, an application field, and a profile. According to this initial setting, initial context values appropriate for the characteristics, such as the type of image, the application field, the profile, and the like, may be used, and thus the compression efficiency may be enhanced.

For example, in the case of a screen content image, the probability of occurrence of a skip mode is higher than that of an image of nature. Therefore, initial probability information for the skip mode may be set to a value higher than that of the initial probability used in the image of nature.

When the probability distribution for any syntax element is similar to a predefined probability distribution model, the encoder or the decoder derives initial probability values for at least one context assigned to any syntax element by taking a binarization method predefined in the syntax element into consideration.

FIG. 22 is a diagram illustrating context initialization according to an embodiment of the present invention.

For example, as shown in FIG. 22 , when probability density distribution for any syntax element abs_mvd is similar to the probability distribution, which is P(x)=2{circumflex over ( )}(−(x−1)) (x>=0), of the unary binarization method, the probability density distribution function P(x) of the unary binarization method is used to perform context initialization for N (N>0) binary values.

Equation 2 below is an example in which when the binarization method for abs_mvd is defined as shown in FIG. 14 above, the probability C0(i) of 0 for the binary index(i) of 0 to 2 is derived using the probability distribution model P(x). C0(0)=P(0)=0.5 C0(1)=P(1)/P(0)=0.25/0.5=0.5 C0(2)=P(2)/P(1)=0.125/0.25=0.5  [Equation 2]

As another example, when the binarization method predefined for any syntax element is unary binarization, the encoder or the decoder derives the initial values of all contexts used in the corresponding syntax element by using the probability distribution P(x)=2{circumflex over ( )}(−(x−1)) (x>=0) of the unary binarization method.

In the meantime, when the current picture supports CTU column-based parallel encoding and decoding using wave-front parallel processing (WPP), the ECU 0 in the CTU column 0 of the picture uses predefined initial context values to initialize all contexts. In the meantime, the ECUs 0 within the CTU x of CTU column k (herein, k>0) may be subjected to entropy encoding or decoding using the context used when the first ECU within the CTU y (herein, y>x) of the CTU column k−1 is entropy encoded or decoded.

FIG. 23 is a diagram illustrating context initialization according to another embodiment of the present invention.

FIG. 23 shows the CTU column-based parallel entropy encoding or decoding method using the WPP to which context initialization according to the present invention is applied. As shown in the figure, the ECU 0 of the CTU column 1 may be subjected to entropy encoding or decoding using the context used for entropy encoding or decoding of the ECU 8 of the CTU column 0 that is a higher CTU column. That is, the encoder or the decoder may update the context using at least one among the number of occurrences of bins within the syntax element which occur when entropy encoding or decoding the ECU 7 of the CTU column 0, and a variable indicating the difference between the number of occurrences of 0 and the number of occurrences of 1. The updated context may be used for entropy encoding or decoding of the ECU 8 of the CTU column 0 and the ECU 0 of the CTU column 1.

Hereinafter, a syntax element grouping method will be described.

FIG. 24 is a diagram illustrating a bitstream according to an embodiment of the present invention. FIG. 25 is a diagram illustrating a bitstream according to another embodiment of the present invention.

The bitstream in FIG. 24 may be an example of the order of general syntax elements within a bitstream. As shown in FIG. 24 , in order to perform entropy decoding and reconstruction on a per-CU basis, all syntax elements included in each CU need to be transmitted in the encoding or decoding order according to each CU. Herein, when the CU is partitioned into one or more TUs, several pieces of TU information in the CU are encoded or decoded in order. Since various syntax elements may be present within the CU, changes of the context may occur frequently during entropy encoding or decoding. Therefore, the context needs to be frequently loaded from the external memory, and thus the throughput in entropy encoding or decoding by the encoder and the decoder may be reduced.

The bitstream in FIG. 25 may be an example of improving the bitstream in FIG. 24 . According to an embodiment of the present invention, the syntax element may be encoded or decoded on a per-ECU basis. The ECU may consist of at least one CU, so that the same syntax elements of the CUs included in the ECU may be grouped.

FIG. 25 shows a bitstream generated by performing ECU-based syntax element grouping. For example, when two CUs are present within one ECU, the encoder groups two pred mode syntax elements for each CU and then groups two MVDs for each CU. Afterward, the encoder may group and transmit syntax elements for residual signal information. In order to decode the bitstream composed of ECU-based syntax element groups, the decoder may separate the grouped syntax elements into CU-based syntax elements.

For example, the encoder or the decoder may perform ECU-based grouping only for residual signal information-related syntax elements. For example, for the residual signal information-related syntax elements that may consist of at least one syntax element, the encoder or the decoder may perform ECU-based grouping on the same syntax elements and may perform encoding or decoding. For example, when four TUs are present within one ECU, the encoder or the decoder constructs groups sig_coeff_flag, gt1_flag, gt2_flag, and remain_abs_level for the four TUs and performs encoding or decoding.

According to the present invention, the frequency of changes of the context may be reduced, so that the throughput of entropy encoding or decoding may be

The above embodiments may be performed in the same method in an encoder and a decoder.

At least one or a combination of the above embodiments may be used to encode/decode a video.

A sequence of applying to above embodiment may be different between an encoder and a decoder, or the sequence applying to above embodiment may be the same in the encoder and the decoder.

The above embodiment may be performed on each luma signal and chroma signal, or the above embodiment may be identically performed on luma and chroma signals.

A block form to which the above embodiments of the present invention are applied may have a square form or a non-square form.

The above embodiment of the present invention may be applied depending on a size of at least one of a coding block, a prediction block, a transform block, a block, a current block, a coding unit, a prediction unit, a transform unit, a unit, and a current unit. Herein, the size may be defined as a minimum size or maximum size or both so that the above embodiments are applied, or may be defined as a fixed size to which the above embodiment is applied. In addition, in the above embodiments, a first embodiment may be applied to a first size, and a second embodiment may be applied to a second size. In other words, the above embodiments may be applied in combination depending on a size. In addition, the above embodiments may be applied when a size is equal to or greater that a minimum size and equal to or smaller than a maximum size. In other words, the above embodiments may be applied when a block size is included within a certain range.

For example, the above embodiments may be applied when a size of current block is 8×8 or greater. For example, the above embodiments may be applied when a size of current block is 4×4 only. For example, the above embodiments may be applied when a size of current block is 16×16 or smaller. For example, the above embodiments may be applied when a size of current block is equal to or greater than 16×16 and equal to or smaller than 64×64.

The above embodiments of the present invention may be applied depending on a temporal layer. In order to identify a temporal layer to which the above embodiments may be applied, a corresponding identifier may be signaled, and the above embodiments may be applied to a specified temporal layer identified by the corresponding identifier. Herein, the identifier may be defined as the lowest layer or the highest layer or both to which the above embodiment may be applied, or may be defined to indicate a specific layer to which the embodiment is applied. In addition, a fixed temporal layer to which the embodiment is applied may be defined.

For example, the above embodiments may be applied when a temporal layer of a current image is the lowest layer. For example, the above embodiments may be applied when a temporal layer identifier of a current image is 1. For example, the above embodiments may be applied when a temporal layer of a current image is the highest layer.

A slice type or a tile group type to which the above embodiments of the present invention are applied may be defined, and the above embodiments may be applied depending on the corresponding slice type or tile group type.

In the above-described embodiments, the methods are described based on the flowcharts with a series of steps or units, but the present invention is not limited to the order of the steps, and rather, some steps may be performed simultaneously or in different order with other steps. In addition, it should be appreciated by one of ordinary skill in the art that the steps in the flowcharts do not exclude each other and that other steps may be added to the flowcharts or some of the steps may be deleted from the flowcharts without influencing the scope of the present invention.

The embodiments include various aspects of examples. All possible combinations for various aspects may not be described, but those skilled in the art will be able to recognize different combinations. Accordingly, the present invention may include all replacements, modifications, and changes within the scope of the claims.

The embodiments of the present invention may be implemented in a form of program instructions, which are executable by various computer components, and recorded in a computer-readable recording medium. The computer-readable recording medium may include stand-alone or a combination of program instructions, data files, data structures, etc. The program instructions recorded in the computer-readable recording medium may be specially designed and constructed for the present invention, or well-known to a person of ordinary skilled in computer software technology field. Examples of the computer-readable recording medium include magnetic recording media such as hard disks, floppy disks, and magnetic tapes; optical data storage media such as CD-ROMs or DVD-ROMs; magneto-optimum media such as floptical disks; and hardware devices, such as read-only memory (ROM), random-access memory (RAM), flash memory, etc., which are particularly structured to store and implement the program instruction. Examples of the program instructions include not only a mechanical language code formatted by a compiler but also a high level language code that may be implemented by a computer using an interpreter. The hardware devices may be configured to be operated by one or more software modules or vice versa to conduct the processes according to the present invention.

Although the present invention has been described in terms of specific items such as detailed elements as well as the limited embodiments and the drawings, they are only provided to help more general understanding of the invention, and the present invention is not limited to the above embodiments. It will be appreciated by those skilled in the art to which the present invention pertains that various modifications and changes may be made from the above description.

Therefore, the spirit of the present invention shall not be limited to the above-described embodiments, and the entire scope of the appended claims and their equivalents will fall within the scope and spirit of the invention.

INDUSTRIAL APPLICABILITY

The present invention may be used to encode or decode an image. 

The invention claimed is:
 1. A method of decoding an image, the method comprising: determining whether to perform a context update for a first syntax element of a current block; updating a context for entropy decoding of the first syntax element in a case that it is determined to perform the context update; and generating, on the basis of the updated context, a bin for the first syntax element, wherein whether to perform the context update is determined based on a comparison between the number of decoded predetermined syntax elements for the current block and a value determined based on a size of the current block.
 2. The method of claim 1, wherein when the number of the decoded predetermined syntax elements is equal to or less than the value, the context update for the first syntax element is performed.
 3. The method of claim 1, wherein a transform skip mode is applied to the current block.
 4. The method of claim 1, wherein the first syntax element is the syntax element indicating a sign of a coefficient.
 5. The method of claim 4, wherein the first syntax element is coeff_sign_flag.
 6. The method of claim 1, wherein the predetermined syntax element is at least one of residual signal-related syntax elements.
 7. The method of claim 5, wherein the predetermined syntax elements comprise a sig_coeff_flag and a par_level_flag.
 8. A method of encoding an image, the method comprising: generating a bin for a first syntax element of a current block by binarizing the first syntax element; determining whether to perform a context update for the first syntax element; updating a context for entropy encoding of the first syntax element in a case that it is determined to perform the context update; and generating a bitstream for the current block by using the updated context and the generated bin, wherein whether to perform the context update is determined based on a comparison between the number of encoded predetermined syntax elements for the current block and a value determined based on a size of the current block.
 9. The method of claim 8, wherein when the number of the encoded predetermined syntax elements is equal to or less than the value, the context update for the first syntax element is performed.
 10. The method of claim 8, wherein a transform skip mode is applied to the current block.
 11. The method of claim 8, wherein the first syntax element is the syntax element indicating a sign of a coefficient.
 12. The method of claim 11, wherein the first syntax element is coeff_sign_flag.
 13. The method of claim 8, wherein the predetermined syntax element is at least one of residual signal-related syntax elements.
 14. The method of claim 13, wherein the predetermined syntax elements comprise a sig_coeff_flag and a par_level_flag.
 15. A non-transitory computer-readable recording medium storing a bitstream that is used to reconstruct a current block included in a current picture, wherein the bitstream is generated by a method of encoding an image, the method including: generating a bin for a first syntax element of the current block by binarizing the first syntax element; determining whether to perform a context update for the first syntax element; updating a context for entropy encoding of the first syntax element in a case that it is determined to perform the context update; and generating a bitstream by using the updated context and the generated bin, wherein whether to perform the context update is determined based on a comparison between the number of decoded predetermined syntax elements for the current block and a value determined based on a size of the current block. 